Global minimization using an Augmented Lagrangian method with variable lower-level constraints

نویسندگان

  • Ernesto G. Birgin
  • Christodoulos A. Floudas
  • José Mario Martínez
چکیده

A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the εk-global minimization of the Augmented Lagrangian with simple constraints, where εk → ε. Global convergence to an ε-global minimizer of the original problem is proved. The subproblems are solved using the αBB method. Numerical experiments are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Augmented Lagrangian Methods with General Lower-Level Constraints

Augmented Lagrangian methods with general lower-level constraints are considered in the present research. These methods are useful when efficient algorithms exist for solving subproblems in which the constraints are only of the lower-level type. Inexact resolution of the lower-level constrained subproblems is considered. Global convergence is proved using the Constant Positive Linear Dependence...

متن کامل

Alternating direction augmented Lagrangian methods for semidefinite programming

We present an alternating direction method based on an augmented Lagrangian framework for solving semidefinite programming (SDP) problems in standard form. At each iteration, the algorithm, also known as a two-splitting scheme, minimizes the dual augmented Lagrangian function sequentially with respect to the Lagrange multipliers corresponding to the linear constraints, then the dual slack varia...

متن کامل

Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality

Abstract This paper presents a canonical duality theory for solving a general nonconvex 1 quadratic minimization problem with nonconvex constraints. By using the canonical dual 2 transformation developed by the first author, the nonconvex primal problem can be con3 verted into a canonical dual problem with zero duality gap. A general analytical solution 4 form is obtained. Both global and local...

متن کامل

An Augmented Lagrangian Method for a Class of Lmi-constrained Problems in Robust Control Theory

We present a new approach to a class of non-convex LMI-constrained problem in robust control theory. The problems we consider may be recast as the minimization of a linear objective subject to linear matrix inequality (LMI) constraints in tandem with non-convex constraints related to rank conditions. We solve these problems using an extension of the augmented Lagrangian technique. The Lagrangia...

متن کامل

Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations

Given a set of corrupted data drawn from a union of multiple subspace, the subspace recovery problem is to segment the data into their respective subspace and to correct the possible noise simultaneously. Recently, it is discovered that the task can be characterized, both theoretically and numerically, by solving a matrix nuclear-norm and a `2,1-mixed norm involved convex minimization problems....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 125  شماره 

صفحات  -

تاریخ انتشار 2010