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 ...
Read More
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.
Read Less
Add this copy of Optimization: Algorithms and Consistent Approximations to cart. $195.99, very good condition, Sold by ThriftBooks-Reno rated 4.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published 2012 by Springer.
Add this copy of Optimization Theory and Algorithms, Vol-124 to cart. $228.20, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 1997 by Springer.
Add this copy of Optimization Theory and Algorithms, Vol-124 to cart. $229.08, new condition, Sold by Basi6 International rated 5.0 out of 5 stars, ships from Irving, TX, UNITED STATES, published 1997 by Springer.
Add this copy of Optimization to cart. $245.31, new condition, Sold by Media Smart rated 3.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 1997 by Springer.
Add this copy of Optimization: Algorithms and Consistent Approximations to cart. $309.99, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2012 by Springer.
Add this copy of Optimization: Algorithms and Consistent Approximations to cart. $311.67, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 782 p. Contains: Tables, black & white. Applied Mathematical Sciences, 124. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Optimization: Algorithms and Consistent Approximations to cart. $311.67, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2012 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 782 p. Contains: Tables, black & white. Applied Mathematical Sciences, 124. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
