An alternating direction-based contraction method for linearly constrained separable convex programming problems
From MaRDI portal
Publication:2841146
DOI10.1080/02331934.2011.611885zbMath1273.90122OpenAlexW2006160074MaRDI QIDQ2841146
Xiao-Ming Yuan, Ming-Hua Xu, Bing-sheng He, Min Tao
Publication date: 24 July 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.611885
convex programmingcontraction methodalternating direction methodseparable structurelinear constraint
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items (28)
A hybrid optimization method for multiplicative noise and blur removal ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ Fast alternating linearization methods for minimizing the sum of two convex functions ⋮ A parallel splitting method for separable convex programs ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ A note on the alternating direction method of multipliers ⋮ A partially parallel prediction-correction splitting method for convex optimization problems with separable structure ⋮ A linear algebra perspective on the random multi-block ADMM: the QP case ⋮ An ADM-based splitting method for separable convex programming ⋮ Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ Proximal-based pre-correction decomposition methods for structured convex minimization problems ⋮ A note on augmented Lagrangian-based parallel splitting method ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ On the convergence analysis of the alternating direction method of multipliers with three blocks ⋮ A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities ⋮ A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization ⋮ Convergence analysis of alternating direction method of multipliers for a class of separable convex programming ⋮ A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ A partial splitting augmented Lagrangian method for low patch-rank image decomposition
Cites Work
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- New parallel descent-like method for solving a class of variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- 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
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- Multiplier and gradient methods
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A descent method for structured monotone variational inequalities
This page was built for publication: An alternating direction-based contraction method for linearly constrained separable convex programming problems
