A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization

DOI10.1137/19M1242276zbMath1464.90070arXiv1812.10229OpenAlexW3048490699MaRDI QIDQ5123998

Zhi-Quan Luo, Jia-Wei Zhang

Publication date: 17 September 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.10229

zbMATH Keywords

nonconvex minimizationADMM constrained

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26)

Related Items

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function, Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, A survey on some recent developments of alternating direction method of multipliers, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, An iterative method based on ADMM for solving generalized Sylvester matrix equations, An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems, An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems, Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers, Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming, A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting, Global optimization for non-convex programs via convex proximal point method, Alternating direction method of multipliers for nonconvex log total variation image restoration, The alternating direction method of multipliers for finding the distance between ellipsoids, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization

Uses Software

• NC-OPT

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Alternating direction method of multipliers for penalized zero-variance discriminant analysis
• On the linear convergence of the alternating direction method of multipliers
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Alternating direction methods for classical and ptychographic phase retrieval
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
• Alternating direction method of multipliers for real and complex polynomial optimization models
• ADMM for multiaffine constrained optimization
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent