An alternating direction-based contraction method for linearly constrained separable convex programming problems

DOI10.1080/02331934.2011.611885zbMath1273.90122MaRDI 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

zbMATH Keywords

convex programming; contraction method; alternating direction method; separable structure; linear constraint

Mathematics Subject Classification ID

90C22: Semidefinite programming

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

Related Items

A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints, 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 hybrid optimization method for multiplicative noise and blur removal, Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, Fast alternating linearization methods for minimizing the sum of two convex functions, A parallel splitting method for separable convex programs, Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization, Proximal-based pre-correction decomposition methods for structured convex minimization problems, A note on augmented Lagrangian-based parallel splitting method, A partially isochronous splitting algorithm for three-block separable convex minimization problems, A partially parallel prediction-correction splitting method for convex optimization problems with separable structure, A note on the alternating direction method of multipliers, An ADM-based splitting method for separable convex programming, On the convergence analysis of the alternating direction method of multipliers with three blocks, Convergence analysis of alternating direction method of multipliers for a class of separable convex programming, A partial splitting augmented Lagrangian method for low patch-rank image decomposition, Inexact alternating direction methods of multipliers for separable convex optimization, An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing

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