An alternating direction-based contraction method for linearly constrained separable convex programming problems
From MaRDI portal
Publication:2841146
DOI10.1080/02331934.2011.611885zbMath1273.90122MaRDI QIDQ2841146
Min Tao, Bing-sheng He, Xiao-Ming Yuan, Ming-Hua Xu
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 programming; contraction method; alternating direction method; separable structure; linear constraint
90C22: Semidefinite programming
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
Related Items
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, 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, 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
