Cantitate/Preț
Produs

Optimization: Algorithms and Consistent Approximations: Applied Mathematical Sciences, cartea 124

Editat de Elijah Polak
en Limba Engleză Hardback – 20 iun 1997
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 180258 lei  6-8 săpt.
  Springer – 21 dec 2012 180258 lei  6-8 săpt.
Hardback (1) 207442 lei  6-8 săpt.
  Springer – 20 iun 1997 207442 lei  6-8 săpt.

Din seria Applied Mathematical Sciences

Preț: 207442 lei

Preț vechi: 252979 lei
-18% Nou

Puncte Express: 3112

Preț estimativ în valută:
39704 41270$ 32889£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387949710
ISBN-10: 0387949712
Pagini: 808
Ilustrații: XX, 782 p.
Dimensiuni: 155 x 235 x 48 mm
Greutate: 1.26 kg
Ediția:1997
Editura: Springer
Colecția Springer
Seria Applied Mathematical Sciences

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Contents: Unconstrained Optimization.- Optimality Conditions.- Algorithm Models and Convergence Conditions I.- Gradient Methods.- Newton's Method.- Methods of Conjugate Directions.- Quasi-Newton Methods.- One Dimensional Optimization.- Newton's Method for Equations and Inequalities.- Finite Minimax and Constrained Optimization.- Optimality Conditions for Minimax.- Optimality Conditions for Constrained Optimization.- Algorithm Models and Convergence Conditions II.- First-Order Minimax Algorithms.- Newton's Method for Minimax Problems.- Phase I. Phase II Methods of Centers .- Penalty Function Algorithms.- An Augmented Lagrangian Method.