Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM

DOI10.1007/s10107-017-1160-5zbMath1401.90151OpenAlexW2616252726MaRDI QIDQ1659676

Y. Aharonov

Publication date: 22 August 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1160-5

zbMATH Keywords

ADMMconvex programmingdecomposition methodsmonotone operators

Mathematics Subject Classification ID

Convex programming (90C25) Monotone operators and generalizations (47H05) Decomposition methods (49M27)

Related Items

Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm ⋮ Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods ⋮ The developments of proximal point algorithms ⋮ A proximal ADMM with the Broyden family for convex optimization problems ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ An inexact proximal generalized alternating direction method of multipliers ⋮ A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance ⋮ Approximate customized proximal point algorithms for separable convex optimization ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ On FISTA with a relative error rule ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Relaxed Regularization for Linear Inverse Problems ⋮ On inexact ADMMs with relative error criteria ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ Implementing the Alternating Direction Method of Multipliers for Big Datasets: A Case Study of Least Absolute Shrinkage and Selection Operator ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis ⋮ Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions ⋮ Relaxed Regularization for Linear Inverse Problems ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance ⋮ Application of the Alternating Direction Method of Multipliers to Control Constrained Parabolic Optimal Control Problems and Beyond ⋮ Projective splitting with forward steps

Uses Software

• L-BFGS
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Convergence rates with inexact non-expansive operators
• A practical relative error criterion for augmented Lagrangians
• On the limited memory BFGS method for large scale optimization
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Approximate ADMM algorithms derived from Lagrangian splitting
• Finding predictive gene groups from microarray data
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• On Fixed Points of Non-Expansive Piecewise Isometric Mappings
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Self Equivalence of the Alternating Direction Method of Multipliers
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM