- Start
- Interior Point Polynomial Algorithms in Convex Programming
Interior Point Polynomial Algorithms in Convex Programming
Angebote / Angebote:
The authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analysed. This approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.
Folgt in ca. 15 Arbeitstagen
Preis
201,00 CHFVerfügbarkeit:
LieferbarArtikel, die Sie kürzlich angesehen haben
Fremdlagertitel. Lieferzeit unbestimmt
