Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
From MaRDI portal
Publication:4963666
zbMath1484.65135arXiv1702.01850MaRDI QIDQ4963666
Jefferson G. Melo, Renato D. C. Monteiro, Max L. N. Gonçalves
Publication date: 19 February 2021
Full work available at URL: https://arxiv.org/abs/1702.01850
nonconvex programming; alternating direction method of multipliers; first-order methods; pointwise iteration-complexity
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
49M27: Decomposition methods
Related Items
An inertial proximal alternating direction method of multipliers for nonconvex optimization, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function, 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, Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters, Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, Misspecified nonconvex statistical optimization for sparse phase retrieval
