A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
From MaRDI portal
Publication:2450861
DOI10.1007/s00211-013-0580-2zbMath1295.90046OpenAlexW2047376837MaRDI QIDQ2450861
Hongjin He, Deren Han, Hai Yang, Xiao-Ming Yuan
Publication date: 23 May 2014
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-013-0580-2
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ A fast splitting method tailored for Dantzig selector ⋮ Unified linear convergence of first-order primal-dual algorithms for saddle point problems ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective ⋮ A proximal alternating linearization method for minimizing the sum of two convex functions ⋮ A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings ⋮ An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game ⋮ A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems ⋮ A new alternating projection-based prediction–correction method for structured variational inequalities ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ A relaxed projection method for split variational inequalities ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity ⋮ A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming ⋮ Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ Variable splitting based method for image restoration with impulse plus Gaussian noise ⋮ 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 ⋮ An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A unified primal-dual algorithm framework based on Bregman iteration
- A reduced Newton method for constrained linear least-squares problems
- An operator splitting method for variational inequalities with partially unknown mappings
- Quadratically constrained least squares and quadratic problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- 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
- A variable-penalty alternating directions method for convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Self-adaptive operator splitting methods for monotone variational inequalities
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- A first-order primal-dual algorithm for convex problems with applications to imaging
- An \(L _{2}\)-theory for a class of SPDEs driven by Lévy processes
- Alternating direction method for covariance selection models
- Multiplier and gradient methods
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Digital Image Processing
- 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
- Robust principal component analysis?
- Linearized Bregman iterations for compressed sensing
- Rank-Sparsity Incoherence for Matrix Decomposition
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Inexact Alternating Direction Methods for Image Recovery
- Alternating Direction Method for Image Inpainting in Wavelet Domains
- Matrix completion via an alternating direction method
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- The Split Bregman Method for L1-Regularized Problems
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Deblurring Images
- Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
- Solving a non-smooth eigenvalue problem using operator-splitting methods
- Two-Point Step Size Gradient Methods
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the basic theorem of complementarity
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- Improvements of some projection methods for monotone nonlinear variational inequalities
