Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
From MaRDI portal
Publication:5210517
DOI10.1137/18M1163993zbMath1434.90158arXiv1709.05747OpenAlexW3103984481MaRDI QIDQ5210517
Panagiotis Patrinos, Andreas Themelis
Publication date: 21 January 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05747
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items (24)
Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ A General Alternating-Direction Implicit Framework with Gaussian Process Regression Parameter Prediction for Large Sparse Linear Systems ⋮ Personalized optimization with user's feedback ⋮ An iterative method based on ADMM for solving generalized Sylvester matrix equations ⋮ Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space ⋮ Training recurrent neural networks by sequential least squares and the alternating direction method of multipliers ⋮ Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming ⋮ Resolvent of the parallel composition and the proximity operator of the infimal postcomposition ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ General splitting methods with linearization for the split feasibility problem ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs ⋮ Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM ⋮ Matrix inference and estimation in multi-layer models* ⋮ Solving blind ptychography effectively via linearized alternating direction method of multipliers ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The method of alternating relaxed projections for two nonconvex sets
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Introductory lectures on convex optimization. A basic course.
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- On the local convergence of the Douglas-Rachford algorithm
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- Self Equivalence of the Alternating Direction Method of Multipliers
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
