A modified barrier-augmented Lagrangian method for constrained minimization

被引:42
作者
Goldfarb, D [1 ]
Polyak, R
Scheinberg, K
Yuzefovich, I
机构
[1] Columbia Univ, Dept IEOR, New York, NY 10027 USA
[2] George Mason Univ, Dept OR, Fairfax, VA 22030 USA
[3] IBM Corp, Thomas J Watson Res Ctr, Yorktown Heights, NY 10598 USA
[4] Univ Haifa, Dept Math Sci, IL-31999 Haifa, Israel
基金
美国国家科学基金会;
关键词
Optimality Condition; Lagrange Multiplier; Operation Research; Mathematical Program; Equality Constraint;
D O I
10.1023/A:1008705028512
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];
摘要
We present and analyze an interior-exterior augmented Lagrangian method for solving constrained optimization problems with both inequality and equality constraints. This method, the modified barrier-augmented Lagrangian (MBAL) method, is a combination of the modified barrier and the augmented Lagrangian methods. It is based on the MBAL function, which treats inequality constraints with a modified barrier term and equalities with an augmented Lagrangian term. The MBAL method alternatively minimizes the MBAL function in the primal space and updates the Lagrange multipliers. For a large enough fixed barrier-penalty parameter the MBAL method is shown to converge Q-linearly under the standard second-order optimality conditions. Q-superlinear convergence can be achieved by increasing the barrier-penalty parameter after each Lagrange multiplier update. We consider a dual problem that is based on the MBAL function. We prove a basic duality theorem for it and show that it has several important properties that fail to hold for the dual based on the classical Lagrangian.
引用
收藏
页码:55 / 74
页数:20
相关论文
共 16 条
[1]
BENTAL A, 1992, 992 TECHN OPT LAB
[2]
BENTAL A, 1995, MATH PROGRAMMING SOC, V47
[3]
BERTSEKAS DP, 1982, CONSTRAINED MINIMIZA
[4]
BREITFELD MG, 1994, LARGE SCALE OPTIMIZATION: STATE OF THE ART, P45
[5]
A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds [J].
Conn, AR ;
Gould, N ;
Toint, PL .
MATHEMATICS OF COMPUTATION, 1997, 66 (217) :261-+
[6]
DEFINITE AND SEMIDEFINITE QUADRATIC FORMS [J].
Debreu, Gerard .
ECONOMETRICA, 1952, 20 (02) :295-300
[7]
DONTCHEV AL, 1998, IN PRESS SIAM J CONT
[8]
Fiacco A.V., 1990, Nonlinear Programming Sequential Unconstrained Minimization Techniques
[9]
HAGER WW, 1997, IN PRESS COMPUTATION
[10]
Hestenes M. R., 1969, Journal of Optimization Theory and Applications, V4, P303, DOI 10.1007/BF00927673