"Lagrange-type Functions in Constrained Non-Convex Optimization" - Information and Links:

Lagrange-type Functions in Constrained Non-Convex Optimization - Info and Reading Options

Book's cover
The cover of “Lagrange-type Functions in Constrained Non-Convex Optimization” - Open Library.

"Lagrange-type Functions in Constrained Non-Convex Optimization" is published by Springer in Nov 22, 2013 - Boston, MA and it has 300 pages.


“Lagrange-type Functions in Constrained Non-Convex Optimization” Metadata:

  • Title: ➤  Lagrange-type Functions in Constrained Non-Convex Optimization
  • Authors:
  • Number of Pages: 300
  • Publisher: Springer
  • Publish Date:
  • Publish Location: Boston, MA

“Lagrange-type Functions in Constrained Non-Convex Optimization” Subjects and Themes:

Edition Specifications:

  • Format: paperback

Edition Identifiers:

AI-generated Review of “Lagrange-type Functions in Constrained Non-Convex Optimization”:


"Lagrange-type Functions in Constrained Non-Convex Optimization" Description:

The Open Library:

This volume provides a systematic examination of Lagrange-type functions and augmented Lagrangians. Weak duality, zero duality gap property and the existence of an exact penalty parameter are examined. Weak duality allows one to estimate a global minimum. The zero duality gap property allows one to reduce the constrained optimization problem to a sequence of unconstrained problems, and the existence of an exact penalty parameter allows one to solve only one unconstrained problem. By applying Lagrange-type functions, a zero duality gap property for nonconvex constrained optimization problems is established under a coercive condition. It is shown that the zero duality gap property is equivalent to the lower semi-continuity of a perturbation function.

Open Data:

This volume provides a systematic examination of Lagrange-type functions and augmented Lagrangians. Weak duality, zero duality gap property and the existence of an exact penalty parameter are examined. Weak duality allows one to estimate a global minimum. The zero duality gap property allows one to reduce the constrained optimization problem to a sequence of unconstrained problems, and the existence of an exact penalty parameter allows one to solve only one unconstrained problem. By applying Lagrange-type functions, a zero duality gap property for nonconvex constrained optimization problems is established under a coercive condition. It is shown that the zero duality gap property is equivalent to the lower semi-continuity of a perturbation function

Read “Lagrange-type Functions in Constrained Non-Convex Optimization”:

Read “Lagrange-type Functions in Constrained Non-Convex Optimization” by choosing from the options below.

Search for “Lagrange-type Functions in Constrained Non-Convex Optimization” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Lagrange-type Functions in Constrained Non-Convex Optimization” in Libraries Near You:

Read or borrow “Lagrange-type Functions in Constrained Non-Convex Optimization” from your local library.

Buy “Lagrange-type Functions in Constrained Non-Convex Optimization” online:

Shop for “Lagrange-type Functions in Constrained Non-Convex Optimization” on popular online marketplaces.