论文信息 - Approximation procedures based on the method of multipliers

Approximation procedures based on the method of multipliers

In this paper, we consider a method for solving certain optimization problems with constraints, nondifferentiabilities, and other ill-conditioning terms in the cost functional by approximating them by well-behaved optimization problems. The approach is based on methods of multipliers. The convergence properties of the methods proposed can be inferred from corresponding properties of multiplier methods with partial elimination of constraints. A related analysis is provided in this paper.

D. Bertsekas

[1] M. Hestenes. Multiplier and gradient methods , 1969 .

[2] D. Bertsekas,et al. A new penalty function method for constrained minimization , 1972, CDC 1972.

[3] R. Rockafellar. The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[4] D. Bertsekas. Convergence rate of penalty and multiplier methods , 1973, CDC 1973.

[5] E. Polak. Introduction to linear and nonlinear programming , 1973 .

[6] D. Bertsekas. Nondifferentiable optimization via approximation , 1975 .

[7] D. Bertsekas. COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION* , 1975 .

[8] B. Mercier,et al. A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[9] Dimitri P. Bertsekas,et al. A new algorithm for solution of resistive networks involving diodes , 1976 .

[10] Dimitri P. Bertsekas,et al. Multiplier methods: A survey , 1975, at - Automatisierungstechnik.

[11] D. Bertsekas. On Penalty and Multiplier Methods for Constrained Minimization , 1976 .