Optimization: Algorithms and Consistent Approximations -
-20% with code BOOKS
Shipping in 17-23 days
30-day return policy
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 ... Full description
You May Also Like
TOP
The Demon-Haunted World: Science as a Candle in the Dark
-20% with code BOOKS
In stock at our supplier
TOP
Many Faces, One Purpose: A Managers Handbook on Women in Firefighting
U. S. Fire Administration, Homeland Security
-20% with code BOOKS
Out of stock
TOP
The Gulf Moment: Arab Relations Since 2011
Florence Gaub, U. S. Army War College, Strategic Studies Institute
-20% with code BOOKS
Out of stock
TOP
Medizinisches Englisch pocket
-20% with code BOOKS
In stock at our supplier
TOP
How Africa Works: Success and Failure on the World's Last Developmental Frontier
-20% with code BOOKS
In stock at our supplier
TOP
The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Algorithms
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
-20% with code BOOKS
In stock at our supplier
TOP
The Unaccountability Machine: Why Big Systems Make Terrible Decisions
-20% with code BOOKS
In stock at our supplier
TOP
Skin in the Game: Hidden Asymmetries in Daily Life
-20% with code BOOKS
In stock at our supplier
TOP
Dinosaurs and Prehistoric Life: The Definitive Visual Guide to Prehistoric Animals
-20% with code BOOKS
In stock at our supplier
TOP
Thinking in Systems: International Bestseller
-20% with code BOOKS
In stock at our supplier
TOP
Crossing Borders: About the birth of the Consortium of European Research Libraries, the organisation's early years and its path to maturity, spanning the period from the late twentieth century to the first decades of the twenty-first century
-20% with code BOOKS
In stock at our supplier
TOP
Cybernetics: Second Edition: Or the Control and Communication in the Animal and the Machine
-20% with code BOOKS
In stock at our supplier
TOP
Empty Vessel: The Story of the Global Economy in One Barge
-20% with code BOOKS
In stock at our supplier
TOP
101 Things I Learned in Architecture School
-20% with code BOOKS
In stock at our supplier
TOP
Einhundert Zitate Female Edition: Ein Postkartenbuch mit 100 Zitaten
-20% with code BOOKS
In stock at our supplier
TOP
Architektur Berlin, Bd. 15 | Building Berlin, Vol. 15: Baukultur in und aus der Hauptstadt | The latest architecture in and out of the capital
-20% with code BOOKS
In stock at our supplier
TOP
Only Dull People Are Brilliant at Breakfast
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Publisher | Springer US |
|---|---|
| Series | Applied Mathematical Sciences |
| Release year | 1997 |
| Cover type | Hardcover |
| EAN | 9780387949710 |