Analysis of the alternating direction method of multipliers for nonconvex problems
Preprint
Abstract
This work investigates the theoretical performance of the alternating-direction method of multipliers (ADMM) as it applies to nonconvex optimization problems, and in particular, problems with nonconvex constraint sets. The alternating direction method of multipliers is an optimization method that has largely been analyzed for convex problems. The ultimate goal is to assess what kind of theoretical convergence properties the method has in the nonconvex case, and to this end, theoretical contributions are two-fold. First, this work analyzes the method with local solution of the ADMM subproblems, which contrasts with much analysis that requires global solutions of the subproblems. Such a consideration is important to practical implementations. Second, it is established that the method still satisfies a local convergence result. The work concludes with some more detailed discussion of how the analysis relates to previous work.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Global Convergence of ADMM in Nonconvex Nonsmooth OptimizationJournal of Scientific Computing, 2018
- Solving nearly-separable quadratic optimization problems as nonsmooth equationsComputational Optimization and Applications, 2017
- An interior-point method for efficient solution of block-structured NLP problems using an implicit Schur-complement decompositionComputers & Chemical Engineering, 2014
- An augmented Lagrangian method for distributed optimizationMathematical Programming, 2014
- Sensitivity and stability analysis for nonlinear programmingAnnals of Operations Research, 1990
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimizationJournal of Optimization Theory and Applications, 1990
- Constrained Optimization and Lagrange Multiplier Methods1982
- Convexification procedures and decomposition methods for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1979
- Sensitivity analysis for nonlinear programming using penalty methodsMathematical Programming, 1976
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimizationJournal of Optimization Theory and Applications, 1975