Convergence Results on Proximal Method of Multipliers in Nonconvex Programming

We describe a primal-dual application of the proximal point algorithm to nonconvex minimization problems. Motivated by the work of Spingarn and more recently by the work of Kaplan and Tichatschke about the proximal point methodology in nonconvex optimization. This paper discusses some local results in two directions. The rst one concerns the application of the proximal method of multipliers to a general nonconvex problem under second order optimality conditions. Secondly we show that without the second order statements, local convergence is obtained for a particular class of nonconvex programs.

[1]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[2]  R. Rockafellar.  Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

[3]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

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

[5]  Le Thi Hoai An,et al.  A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem , 1998, SIAM J. Optim..

[6]  Reiner Horst,et al.  A new algorithm for solving the general quadratic programming problem , 1993, Comput. Optim. Appl..

[7]  J. Dussault,et al.  A New Decomposition Method in Nonconvex Programming Via a Separable Augmented Lagrangian , 1997 .

[8]  N. Watanabe,et al.  Decomposition in large system optimization using the method of multipliers , 1978 .

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

[10]  B. Lemaire.  About the Convergence of the Proximal Method , 1992 .

[11]  F. Luque.  Asymptotic convergence analysis of the proximal point algorithm , 1984 .

[12]  Jonathan Eckstein.  Parallel alternating direction multiplier decomposition of convex programs , 1994 .

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

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

[15]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[16]  H. Mukai,et al.  A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Problem , 1983, 1983 American Control Conference.

[17]  J. Spingarn.  Submonotone mappings and the proximal point algorithm , 1982 .

[18]  Jonathan E. Spingarn,et al.  Applications of the method of partial inverses to convex programming: Decomposition , 1985, Math. Program..

[19]  Alexander Kaplan,et al.  Proximal Point Methods and Nonconvex Optimization , 1998, J. Glob. Optim..

[20]  Andrzej Ruszczynski,et al.  On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization , 1995, Math. Oper. Res..

[21]  M. J. D. Powell,et al.  A method for nonlinear constraints in minimization problems , 1969 .

[22]  R. Glowinski,et al.  Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics , 1987 .

[23]  D. Bertsekas.  The Method of Multipliers for Inequality Constrained and Nondifferentiable Optimization Problems , 1982 .

[24]  Bernard Martinet,et al.  Algorithmes pour la résolution de problèmes d'optimisation et de minimax , 1972 .

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

[26]  W. Gander,et al.  A D.C. OPTIMIZATION ALGORITHM FOR SOLVING THE TRUST-REGION SUBPROBLEM∗ , 1998 .

[27]  Stephen J. Wright.  Implementing proximal point methods for linear programming , 1990 .

[28]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[29]  Masao Fukushima,et al.  PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS , 1996 .

[30]  Werner Oettli,et al.  An algorithm for indefinite quadratic programming with convex constraints , 1991, Oper. Res. Lett..

[31]  Shin-Yeu Lin.  Complete decomposition algorithm for nonconvex separable optimization problems and applications , 1992, Autom..

[32]  M. Fukushima,et al.  A minimization method for the sum of a convex function and a continuously differentiable function , 1981 .

[33]  Piotr Tatjewski,et al.  Two-level primal-dual decomposition technique for large-scale nonconvex optimization problems with constraints , 1990 .

[34]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[35]  D. Bertsekas.  Convexification procedures and decomposition methods for nonconvex optimization problems , 1979 .

[36]  Jonathan Eckstein,et al.  Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..