Articoli correlati a Optimization: Algorithms and Consistent Approximations:...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
1 Unconstrained Optimization.- 2 Finite Min-Max and Constrained Optimization.- 3 Semi-Infinite Optimization.- 4 Optimal Control.- 5 Mathematical Background.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2012
- ISBN 10 1461268613
- ISBN 13 9781461268611
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine808
- RedattorePolak Elijah
Compra nuovo
Visualizza questo articolo
EUR 165,80
EUR 23,00 per la spedizione da Germania a U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Optimization: Algorithms and Consistent Approximations:...
Immagini fornite dal venditore
Optimization
Editore:
Springer New York Dez 2012, 2012
ISBN 10: 1461268613
ISBN 13: 9781461268611
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461268611
Quantità: 2 disponibili
Immagini fornite dal venditore
Optimization
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 4189498
Quantità: Più di 20 disponibili
Foto dell'editore
Optimization: Algorithms and Consistent Approximations (Applied Mathematical Sciences)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781461268611_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Optimization : Algorithms and Consistent Approximations
Editore:
Springer New York, Springer US, 2012
ISBN 10: 1461268613
ISBN 13: 9781461268611
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461268611
Quantità: 1 disponibili
Foto dell'editore
Optimization: Algorithms and Consistent Approximations (Applied Mathematical Sciences)
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 802 pages. 9.25x6.10x1.82 inches. In Stock. Codice articolo x-1461268613
Quantità: 2 disponibili