Articles liés à Optimization: Algorithms and Consistent Approximations
- ÉditeurSpringer
- Date d'édition2012
- ISBN 10 1461268613
- ISBN 13 9781461268611
- ReliureBroché
- Langueanglais
- Nombre de pages808
- ÉditeurPolak Elijah
Acheter neuf
Afficher cet article
EUR 165,80
EUR 23 expédition depuis Allemagne vers Etats-Unis
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Optimization: Algorithms and Consistent Approximations
Image fournie par le vendeur
Optimization
Edité par
Springer New York Dez 2012, 2012
ISBN 10 : 1461268613
ISBN 13 : 9781461268611
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 becomes transparent. 808 pp. Englisch. N° de réf. du vendeur 9781461268611
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Optimization
Edité par
Springer New York, 2012
ISBN 10 : 1461268613
ISBN 13 : 9781461268611
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4189498
Quantité disponible : Plus de 20 disponibles
Image d'archives
Optimization: Algorithms and Consistent Approximations (Applied Mathematical Sciences)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461268611_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Optimization : Algorithms and Consistent Approximations
Edité par
Springer New York, Springer US, 2012
ISBN 10 : 1461268613
ISBN 13 : 9781461268611
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9781461268611
Quantité disponible : 1 disponible(s)
Image d'archives
Optimization: Algorithms and Consistent Approximations (Applied Mathematical Sciences)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 802 pages. 9.25x6.10x1.82 inches. In Stock. N° de réf. du vendeur x-1461268613
Quantité disponible : 2 disponible(s)