Items related to Lagrange-type Functions in Constrained Non-Convex Optimizati...

Lagrange-type Functions in Constrained Non-Convex Optimization (Applied Optimization, 85) - Hardcover

 
9781402076275: Lagrange-type Functions in Constrained Non-Convex Optimization (Applied Optimization, 85)
View all copies of this ISBN edition:
 
 
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 implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza­ tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions.

"synopsis" may belong to another edition of this title.

Review:

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 analysis of the first and second order optimality conditions. ... A number of impressive new results on the existence of an exact penalty parameter have been obtained in the book." (Vladimir Gaitsgory, gazette The Australian Mathematical Society, Vol. 32 (4), 2005)

"In the monograph a whole optimization theory is developed ... . Besides a large number of theoretical statements, results of numerical experiments showing usefulness of the presented approach are also reported ... . It is shown that a much larger class of optimization problems than that of the convex ones allow for a thorough theoretical analysis and deep results. ... The monograph can be recommended to researchers in mathematical optimization being in interested in nonconvex problems." (Stephan Dempe, OR-News, Issue 23, 2005)

"About this title" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2003
  • ISBN 10 1402076274
  • ISBN 13 9781402076275
  • BindingHardcover
  • Number of pages300

Other Popular Editions of the Same Title

9781461348214: Lagrange-type Functions in Constrained Non-Convex Optimization (Applied Optimization, 85)

Featured Edition

ISBN 10:  1461348218 ISBN 13:  9781461348214
Publisher: Springer, 2013
Softcover

Top Search Results from the AbeBooks Marketplace

Stock Image

Rubinov, Alexander M.; Xiao-qi Yang
Published by Springer (2003)
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: > 20
Seller:
Lucky's Textbooks
(Dallas, TX, U.S.A.)

Book Description Condition: New. Seller Inventory # ABLIING23Mar2411530144876

More information about this seller | Contact seller

Buy New
US$ 116.64
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds
Stock Image

Alexander M. Rubinov
Published by Springer (2003)
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: > 20
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)

Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9781402076275_lsuk

More information about this seller | Contact seller

Buy New
US$ 122.47
Convert currency

Add to Basket

Shipping: US$ 12.33
From United Kingdom to U.S.A.
Destination, rates & speeds
Seller Image

Xiao-Qi Yang
Published by Springer US Nov 2003 (2003)
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: 2
Print on Demand
Seller:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Germany)

Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions. 304 pp. Englisch. Seller Inventory # 9781402076275

More information about this seller | Contact seller

Buy New
US$ 117.41
Convert currency

Add to Basket

Shipping: US$ 24.50
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Alexander M. Rubinov|Xiao-qi Yang
Published by Springer US (2003)
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: > 20
Print on Demand
Seller:
moluna
(Greven, Germany)

Book Description Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . Seller Inventory # 4095211

More information about this seller | Contact seller

Buy New
US$ 101.25
Convert currency

Add to Basket

Shipping: US$ 52.19
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Xiao-Qi Yang
Published by Springer US (2003)
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: 1
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)

Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 implementation. Thus the question arises how to generalize classical Lagrange and penalty functions, in order to obtain an appropriate scheme for reducing constrained optimiza tion problems to unconstrained ones that will be suitable for sufficiently broad classes of optimization problems from both the theoretical and computational viewpoints. Some approaches for such a scheme are studied in this book. One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations. We shall call functions that appear as a convolution of the objective function and the constraint functions, Lagrange-type functions. Seller Inventory # 9781402076275

More information about this seller | Contact seller

Buy New
US$ 121.88
Convert currency

Add to Basket

Shipping: US$ 35.15
From Germany to U.S.A.
Destination, rates & speeds
Stock Image

Alexander Rubinov
ISBN 10: 1402076274 ISBN 13: 9781402076275
New Hardcover Quantity: > 20
Print on Demand
Seller:
THE SAINT BOOKSTORE
(Southport, United Kingdom)

Book Description Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781402076275

More information about this seller | Contact seller

Buy New
US$ 147.63
Convert currency

Add to Basket

Shipping: US$ 11.05
From United Kingdom to U.S.A.
Destination, rates & speeds