Optimally linearizing the alternating direction method of multipliers for convex programming
From MaRDI portal
Publication:2301139
DOI10.1007/s10589-019-00152-3zbMath1432.90111OpenAlexW2986987282WikidataQ126790181 ScholiaQ126790181MaRDI QIDQ2301139
Feng Ma, Bing-sheng He, Xiao-Ming Yuan
Publication date: 28 February 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00152-3
convex programmingconvergence ratealternating direction method of multiplierslinearizedproximal regularizationoptimal step size
Related Items (20)
Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter ⋮ A proximal ADMM with the Broyden family for convex optimization problems ⋮ Whiteness-based parameter selection for Poisson data in variational image processing ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ Inertial-relaxed splitting for composite monotone inclusions ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization ⋮ Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM ⋮ A relaxed proximal ADMM method for block separable convex programming ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ A parallel splitting ALM-based algorithm for separable convex programming ⋮ On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- A unified primal-dual algorithm framework based on Bregman iteration
- 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
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Approximate ADMM algorithms derived from Lagrangian splitting
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Inexact Alternating Direction Methods for Image Recovery
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- First-Order Methods in Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- A splitting method for separable convex programming
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
This page was built for publication: Optimally linearizing the alternating direction method of multipliers for convex programming
