A GLOBALLY CONVERGENT AUGMENTED LAGRANGIAN ALGORITHM FOR OPTIMIZATION WITH GENERAL CONSTRAINTS AND SIMPLE BOUNDS

被引：559

作者：

CONN, AR ^{[1
]}

GOULD, NIM ^{[1
]}

TOINT, PL ^{[1
]}

机构：

[1] UKAEA,DIV COMP SCI & SYST,HARWELL OX11 0RA,BERKS,ENGLAND

来源：

SIAM JOURNAL ON NUMERICAL ANALYSIS | 1991年 / 28卷 / 02期

关键词：

CONSTRAINED OPTIMIZATION; AUGMENTED LAGRANGIAN; SIMPLE BOUNDS; GENERAL CONSTRAINTS;

D O I：

10.1137/0728030

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems are considered. In such methods, simple bound constraints are treated separately from more general constraints and the stopping rules for the inner minimization algorithm have this in mind. Global convergence is proved, and it is established that a potentially troublesome penalty parameter is bounded away from zero.

引用

页码：545 / 572

页数：28

共 35 条

[31] THE CONJUGATE-GRADIENT METHOD AND TRUST REGIONS IN LARGE-SCALE OPTIMIZATION
STEIHAUG, T
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1983, 20 (03) : 626 - 637
[32] DIAGONALIZED MULTIPLIER METHODS AND QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
TAPIA, RA
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1977, 22 (02) : 135 - 194
[33] TOINT PL, 1981, SPARSE MATRICES THEI
[34] TOINT PL, 1988, SIMULATION OPTIMIZAT
[35] YAMASHITA H, 1985, MATH PROGRAM, V23, P75

← 1 2 3 4 →