Optimization: Algorithms and Consistent Approximations (Applied Mathematical Sciences, 124)

ISBN 10: 0387949712 ISBN 13: 9780387949710
Verlag: Springer, 1997
Neu Hardcover

Verkäufer Ria Christie Collections, Uxbridge, Vereinigtes Königreich Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

AbeBooks-Verkäufer seit 25. März 2015


Beschreibung

Beschreibung:

In. Bestandsnummer des Verkäufers ria9780387949710_new

Diesen Artikel melden

Inhaltsangabe:

This book deals with optimality conditions, algorithms, and discretization tech­ niques for nonlinear programming, semi-infinite optimization, and optimal con­ trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con­ sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob­ lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo­ rithms. Second, many optimization algorithms can be shown to use search directions that are obtained in evaluating optimality functions, thus establishing a clear relationship between optimality conditions and algorithms. Third, estab­ lishing optimality conditions for highly complex problems, such as optimal con­ trol problems with control and trajectory constraints, is much easier in terms of optimality functions than in the classical manner. In addition, the relationship between optimality conditions for finite-dimensional problems and semi-infinite optimization and optimal control problems becomestransparent.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Bibliografische Details

Titel: Optimization: Algorithms and Consistent ...
Verlag: Springer
Erscheinungsdatum: 1997
Einband: Hardcover
Zustand: New

Beste Suchergebnisse beim ZVAB

Beispielbild für diese ISBN

Unbekannt
Verlag: Springer New York, 1997
ISBN 10: 0387949712 ISBN 13: 9780387949710
Gebraucht Hardcover

Anbieter: Buchpark, Trebbin, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 808 | Sprache: Englisch | Produktart: Bücher | This book deals with optimality conditions, algorithms, and discretization tech­ niques for nonlinear programming, semi-infinite optimization, and optimal con­ trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con­ sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob­ lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo­ rithms. Second, many optimization algorithms can be shown to use search directions that are obtained in evaluating optimality functions, thus establishing a clear relationship between optimality conditions and algorithms. Third, estab­ lishing optimality conditions for highly complex problems, such as optimal con­ trol problems with control and trajectory constraints, is much easier in terms of optimality functions than in the classical manner. In addition, the relationship between optimality conditions for finite-dimensional problems and semi-infinite optimization and optimal control problems becomestransparent. Artikel-Nr. 647642/2

Verkäufer kontaktieren

Gebraucht kaufen

EUR 25,20
EUR 105,00 shipping
Versand von Deutschland nach USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Polak, Elijah
ISBN 10: 0387949712 ISBN 13: 9780387949710
Gebraucht Hardcover

Anbieter: Antiquariat Bernhardt, Kassel, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

gebundene Ausgabe. Zustand: Sehr gut. Applied Mathematical Sciences, Band 124. Zust: Gutes Exemplar. XX, 779 S., Englisch 1260g. Artikel-Nr. 489931

Verkäufer kontaktieren

Gebraucht kaufen

EUR 47,90
EUR 39,95 shipping
Versand von Deutschland nach USA

Anzahl: 1 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Verlag: Springer, 1997
ISBN 10: 0387949712 ISBN 13: 9780387949710
Neu Hardcover

Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-89464

Verkäufer kontaktieren

Neu kaufen

EUR 194,07
Versand gratis
Versand innerhalb von USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Polak, Elijah
Verlag: Springer New York, 1997
ISBN 10: 0387949712 ISBN 13: 9780387949710
Neu Hardcover

Anbieter: moluna, Greven, Deutschland

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. Artikel-Nr. 5912272

Verkäufer kontaktieren

Neu kaufen

EUR 294,19
EUR 48,99 shipping
Versand von Deutschland nach USA

Anzahl: Mehr als 20 verfügbar

In den Warenkorb

Beispielbild für diese ISBN

Polak E. Polak Elijah
Verlag: Springer, 1997
ISBN 10: 0387949712 ISBN 13: 9780387949710
Neu Hardcover

Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich

Verkäuferbewertung 4 von 5 Sternen 4 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Zustand: New. pp. 808 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Artikel-Nr. 7565227

Verkäufer kontaktieren

Neu kaufen

EUR 301,92
EUR 7,40 shipping
Versand von Vereinigtes Königreich nach USA

Anzahl: 1 verfügbar

In den Warenkorb

Foto des Verkäufers

Elijah Polak
ISBN 10: 0387949712 ISBN 13: 9780387949710
Neu Hardcover

Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book deals with optimality conditions, algorithms, and discretization tech niques for nonlinear programming, semi-infinite optimization, and optimal con trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo rithms. Second, many optimization algorithms can be shown to use search directions that are obtained in evaluating optimality functions, thus establishing a clear relationship between optimality conditions and algorithms. Third, estab lishing optimality conditions for highly complex problems, such as optimal con trol problems with control and trajectory constraints, is much easier in terms of optimality functions than in the classical manner. In addition, the relationship between optimality conditions for finite-dimensional problems and semi-infinite optimization and optimal control problems becomestransparent. Artikel-Nr. 9780387949710

Verkäufer kontaktieren

Neu kaufen

EUR 366,41
EUR 66,81 shipping
Versand von Deutschland nach USA

Anzahl: 1 verfügbar

In den Warenkorb