Stock image for illustration purposes only - book cover, edition or condition may vary.
Lagrange-type Functions in Constrained Non-convex Optimization
Rubinov, Alexander; Yang, Xiao-Qi
€ 128.81
FREE Delivery in Ireland
Description for Lagrange-type Functions in Constrained Non-convex Optimization
Hardback. Provides an examination of Lagrange-type functions and augmented Lagrangians. This book examines weak duality, zero duality gap property and the existence of an exact penalty parameter. By applying Lagrange-type functions, a zero duality gap property for nonconvex constrained optimization problems is established under a coercive condition. Series: Applied Optimization. Num Pages: 300 pages, biography. BIC Classification: PBU. Category: (G) General (US: Trade); (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 234 x 156 x 17. Weight in Grams: 603.
Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems. However, for a nonconvex constrained optimization problem, the classical Lagrange primal-dual method may fail to find a mini mum as a zero duality gap is not always guaranteed. A large penalty parameter is, in general, required for classical quadratic penalty functions in order that minima of penalty problems are a good approximation to those of the original constrained optimization problems. It is well-known that penaity functions with too large parameters cause an obstacle for numerical ... Read more
Lagrange and penalty function methods provide a powerful approach, both as a theoretical tool and a computational vehicle, for the study of constrained optimization problems. However, for a nonconvex constrained optimization problem, the classical Lagrange primal-dual method may fail to find a mini mum as a zero duality gap is not always guaranteed. A large penalty parameter is, in general, required for classical quadratic penalty functions in order that minima of penalty problems are a good approximation to those of the original constrained optimization problems. It is well-known that penaity functions with too large parameters cause an obstacle for numerical ... Read more
Product Details
Format
Hardback
Publication date
2003
Publisher
Kluwer Academic Publishers United States
Number of pages
300
Condition
New
Series
Applied Optimization
Number of Pages
286
Place of Publication
New York, NY, United States
ISBN
9781402076275
SKU
V9781402076275
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Lagrange-type Functions in Constrained Non-convex Optimization
From the reviews: "Lagrange and penalty functions provide a powerful approach for study of constrained optimization problems. … The book gives a systematic and unified presentation of many important results that have been obtained in this area during last several years. … The book develops a unified approach to duality and penalization and to convergence ... Read more