On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the global and linear convergence of the generalized alternating direction method of multipliers
On the $O(1/n)$ convergence rate of the Douglas-Rachford alternating direction method
Hankel matrix rank minimization with applications to system identification and realization
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
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
A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
Implicit Functions and Solution Mappings
Optimization and nonsmooth analysis
Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
Proximité et dualité dans un espace hilbertien
A new inexact alternating directions method for monotone variational inequalities
A majorization-minimization approach to variable selection using spike and slab priors
An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
A note on the alternating direction method of multipliers
Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
Parallel multi-block ADMM with $o(1/k)$ convergence
A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
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
Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
On the linear convergence of the alternating direction method of multipliers
Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization
Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
On the Global Linear Convergence of the ADMM with MultiBlock Variables
A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
A practical relative error criterion for augmented Lagrangians
Inexact alternating direction methods of multipliers for separable convex optimization
On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems
Optimally linearizing the alternating direction method of multipliers for convex programming
Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
Approximate ADMM algorithms derived from Lagrangian splitting
On inexact ADMMs with relative error criteria
A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers
A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition Based Proximal Admms for Convex Composite Programming
A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

Cited In (6)

On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Accelerated stochastic Peaceman-Rachford method for empirical risk minimization
A sequential ADMM algorithm to find sparse LCP solutions using a $l_2-l_1$ regularization technique with application in bimatrix game
An inexact majorized proximal alternating direction method of multipliers for diffusion tensors
On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems
An Efficient Inexact Gauss–Seidel-Based Algorithm for Image Restoration with Mixed Noise

Uses Software

QSDPNAL

This page was built for publication: On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012883)