On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming
From MaRDI portal
Publication:5012883
DOI10.1142/S0217595920500359zbMath1481.90254OpenAlexW3036768742MaRDI QIDQ5012883
Publication date: 26 November 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920500359
inexactconvex composite optimizationsymmetric Gauss-Seidelindefinite proximal termsmajorized ADMMrelative error control
Related Items
A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization ⋮ On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- A practical relative error criterion for augmented Lagrangians
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- On the linear convergence of the alternating direction method of multipliers
- A majorization-minimization approach to variable selection using spike and slab priors
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
- 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
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A new inexact alternating directions method for monotone variational inequalities
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
- Approximate ADMM algorithms derived from Lagrangian splitting
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- On inexact ADMMs with relative error criteria
- A note on the alternating direction method of multipliers
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- Inexact alternating direction methods of multipliers for separable convex optimization
- Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Implicit Functions and Solution Mappings
- Optimization and nonsmooth analysis
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal Admms for Convex Composite Programming
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- Proximité et dualité dans un espace hilbertien
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
