A parallel splitting method for separable convex programs
From MaRDI portal
Publication:382899
DOI10.1007/s10957-013-0277-9zbMath1281.90034OpenAlexW2028075625MaRDI QIDQ382899
Lingling Xu, Deren Han, Kai Wang
Publication date: 22 November 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0277-9
convex programmingparallel computingaugmented Lagrangian methodalternating direction methodseparable structure
Related Items (5)
Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ A new parallel splitting descent method for structured variational inequalities ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Two-phase approach for deblurring images corrupted by impulse plus Gaussian noise
- 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
- Advances in randomized parallel computing
- A proximal-based deomposition method for compositions method for convex minimization problems
- A note on the alternating direction method of multipliers
- An ADM-based splitting method for separable convex programming
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Deblurring Images
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
- Projection methods for variational inequalities with application to the traffic assignment problem
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Sparsity and Smoothness Via the Fused Lasso
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Improvements of some projection methods for monotone nonlinear variational inequalities
This page was built for publication: A parallel splitting method for separable convex programs
