Convexification procedures and decomposition methods for nonconvex optimization problems

In order for primal-dual methods to be applicable to a constrained minimization problem, it is necessary that restrictive convexity conditions are satisfied. In this paper, we consider a procedure by means of which a nonconvex problem is convexified and transformed into one which can be solved with the aid of primal-dual methods. Under this transformation, separability of the type necessary for application of decomposition algorithms is preserved. This feature extends the range of applicability of such algorithms to nonconvex problems. Relations with multiplier methods are explored with the aid of a local version of the notion of a conjugate convex function.

[1]  G. Debreu.  Definite and Semidefinite Quadratic Forms , 1952 .

[2]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[3]  J. E. Falk.  Lagrange multipliers and nonlinear programming , 1967 .

[4]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[5]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

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

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

[8]  R. Tyrrell Rockafellar,et al.  A dual approach to solving nonlinear programming problems by unconstrained optimization , 1973, Math. Program..

[9]  G. Stephanopoulos,et al.  The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization , 1975 .

[10]  D. Bertsekas.  On the method of multipliers for convex programming , 1975 .

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

[12]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[13]  D. Bertsekas,et al.  Combined Primal–Dual and Penalty Methods for Convex Programming , 1976 .

[14]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

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

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