"synopsis" may belong to another edition of this title.
"About this title" may belong to another edition of this title.
Shipping:
US$ 4.00
Within U.S.A.
Book Description Hardcover. Condition: new. New. Fast Shipping and good customer service. Seller Inventory # Holz_New_0387949712
Book Description Condition: New. New. In shrink wrap. Looks like an interesting title! 2.77. Seller Inventory # Q-0387949712
Book Description Condition: Brand New. New. US edition. Excellent Customer Service. Seller Inventory # ABEOCT23-78554
Book Description Condition: New. Brand New Original US Edition.We Ship to PO BOX Address also. EXPEDITED shipping option also available for faster delivery.This item may ship from the US or other locations in India depending on your location and availability. Seller Inventory # ABTR-223755
Book Description Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. This item may ship from the US or our Overseas warehouse depending on your location and stock availability. We Ship to PO BOX Location also. Seller Inventory # ABRR-223755
Book Description Hardcover. Condition: new. Seller Inventory # 9780387949710
Book Description Gebunden. Condition: New. Seller Inventory # 5912272
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780387949710_lsuk
Book Description Condition: New. Seller Inventory # ABLIING23Feb2215580174298
Book Description Buch. Condition: 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. Seller Inventory # 9780387949710