ABSTRACT. Exact penalty methods for the solution of constrained optimization problems are based on the construction of a function whose unconstrained minimizing points are also solution of the constrained problem. In the first part of this paper we recall some definitions concerning exactness properties of penalty functions, of barrier functions, of augmented Lagrangian functions, and discuss under which assumptions on the constrained problem these properties can be ensured. In the second part of the paper we consider algorithmic aspects of exact penalty methods; in particular we show that, by making use of continuously differentiable functions that possess exactness properties, it is possible to define implementable algorithms that are globally convergent with superlinear convergence rate towards KKT points of the constrained problem. 1
|
599
|
Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall
– DENNIS, SCHNABEL
- 1983
|
|
482
|
F.H.: Optimization and Nonsmooth Analysis
– Clarke
- 1983
|
|
279
|
Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific
– Bertsekas
- 1996
|
|
48
|
A globally convergent method for nonlinear programming
– Han
- 1977
|
|
22
|
Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
– GABAY
- 1982
|
|
20
|
Nonlinear programming via an exact penalty function: global analysis
– COLEMAN, CONN
- 1982
|
|
18
|
An ℓ1 penalty method for nonlinear constraints, Numerical Optimization
– Fletcher
- 1984
|
|
18
|
The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangian type line search function II. An efficient implementation using linear least squares subproblems
– Schittkowski
- 1981
|
|
17
|
Exact penalty function algorithms for finite dimensional and control optimization problems
– Maratos
- 1978
|
|
11
|
Constrained optimization using a nondifferentiable penalty function
– CONN
- 1973
|
|
11
|
A class of methods for nonlinear programming with termination and convergence properties
– FLETCHER
- 1970
|
|
11
|
An exact potential method for constrained maxima
– Pietrzykowski
- 1969
|
|
10
|
Necessary and Sufficient Conditions for a Penalty Method to be Exact
– Bertsekas
- 1975
|
|
10
|
A robust sequential quadratic programming method
– Burke, Han
- 1989
|
|
10
|
A recursive quadratic programming algorithm that uses differentiable exact penalty functions
– Powell, Yuan
- 1986
|
|
10
|
Nonlinear Programming via Penalty Functions
– Zangwill
- 1967
|
|
8
|
A successive quadratic programming algorithm with global and superlinear convergence properties
– Fukushima
- 1986
|
|
8
|
A multiplier method with automatic limitation of penalty growth
– Glad, Polak
- 1979
|
|
8
|
Exact penalty functions in nonlinear programming
– Han, Mangasarian
- 1979
|
|
7
|
A sequential quadratic programming method for potentially infeasible mathematical programs
– Burke
- 1989
|
|
7
|
A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems
– Pillo, Grippo
- 1985
|
|
7
|
An RQP algorithm using a differentiable exact penalty function for inequality constrained problems
– Pillo, Facchinei, et al.
- 1992
|
|
7
|
Taxcnnetric methods
– E, &Golden
- 1982
|
|
5
|
A class of penalty functions for optimization problems with bound constraints
– Facchinei, Lucidi
- 1992
|
|
5
|
A convergence theory for a class of quasi-Newton methods for constrained optimization
– FONTECILLA, STEIHAUG, et al.
- 1987
|
|
4
|
A penalty function method converging directly to a constrained optimum
– Conn, Pietrzykowski
- 1977
|
|
4
|
Globally convergent exact penalty algorithms for constrained optimization
– PILLO, GRIPPO, et al.
- 1986
|
|
4
|
New results on a class of exact augmented Lagrangians
– Lucidi
- 1988
|
|
4
|
Exact penalties and sufficient conditions for optimality in nonsmooth optimization
– Ward
- 1988
|
|
3
|
Sufficient Conditions for a Globally Exact Penalty Function without Convexity
– Bazaraa, Goode
- 1982
|
|
3
|
Exact penalty functions for nondifferentiable programming problems
– Pillo, Facchinei
- 1989
|
|
3
|
A new class of augmented Lagrangians in nonlinear programming
– Pillo, Grippo
- 1979
|
|
3
|
Exact penalty functions in nonlinear programming
– Evans, Gould, et al.
- 1973
|
|
3
|
order corrections for non-differentiable optimization
– Second
- 1982
|
|
3
|
Exact auxiliary functions in optimization problems
– Yevtushenko, Zhadan
- 1990
|
|
2
|
On the convergence of some constrained minimization algorithms based on recursive quadratic programming
– BIGGS
- 1978
|
|
2
|
An exact penalty-lagrangian approach for a class of constrained optimization problems with bounded variables
– Pillo, Lucidi, et al.
- 1993
|
|
2
|
Exact penalty functions and Lagrange multipliers
– Facchinei
- 1991
|
|
2
|
A new recursive quadratic programming algorithm with global and superlinear convergence properties
– Facchinei
- 1993
|
|
2
|
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
– Mukai, Polak
- 1975
|
|
2
|
On the global stabilization of locally convergent algorithms
– Polak
- 1976
|
|
2
|
Exact penalty functions and stability in locally lipschitz programming
– Rosenberg
- 1984
|
|
1
|
Th'eorie de la p'enalisation exacte
– Bonnans
- 1990
|
|
1
|
and exact penalization
– Calmness
- 1991
|
|
1
|
programming via an exact penalty method: global analysis
– Nonlinear
- 1982
|
|
1
|
function methods, in Nonlinear Optimization
– Penalty
- 1981
|
|
1
|
An algorithm for nonlinear equality constrained optimization using the DiPillo-Grippo exact penalty function
– Dew
- 1985
|
|
1
|
A method for solving equality constrained optimization problems by unconstrained minimization
– Pillo, Grippo, et al.
- 1980
|
|
1
|
Exact penalty function methods in nonlinear programming
– Dixon
- 1979
|
|
1
|
results on a continuously differentiable exact penalty function
– New
- 1992
|
|
