An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing

DOI10.1090/S0025-5718-2014-02829-9zbMath1311.90100OpenAlexW1994245404MaRDI QIDQ3189422

Deren Han, Wenxing Zhang, Xiao-Ming Yuan

Publication date: 10 September 2014

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02829-9

zbMATH Keywords

image processingconvex programmingparallel processingsplitting methodaugmented Lagrangian methodseparable convex function

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (47)

A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ A parallel Gauss-Seidel method for convex problems with separable structure ⋮ 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 ⋮ On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming ⋮ A proximal Peaceman-Rachford splitting method for compressive sensing ⋮ Improved graph cut model with features of superpixels and neighborhood patches for myocardium segmentation from ultrasound image ⋮ Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function ⋮ On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ A new parallel splitting descent method for structured variational inequalities ⋮ A parallel splitting method for separable convex programs ⋮ Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ A proximal alternating linearization method for minimizing the sum of two convex functions ⋮ Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ On the Efficiency of Random Permutation for ADMM and Coordinate Descent ⋮ Efficient iterative solution of finite element discretized nonsmooth minimization problems ⋮ A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing ⋮ Convergence rate of a proximal multiplier algorithm for separable convex minimization ⋮ Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ On the convergence rate of the augmented Lagrangian-based parallel splitting method ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ A new alternating direction method for linearly constrained nonconvex optimization problems ⋮ A note on augmented Lagrangian-based parallel splitting method ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version ⋮ Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis ⋮ A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming ⋮ A parallel operator splitting algorithm for solving constrained total-variation retinex ⋮ A proximal multiplier method for separable convex minimization ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ Variable splitting based method for image restoration with impulse plus Gaussian noise ⋮ 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 ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ A proximal alternating direction method for multi-block coupled convex optimization ⋮ Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ Dual–primal proximal point algorithms for extended convex programming ⋮ A proximal partially parallel splitting method for separable convex programs

Uses Software

• PROPACK
• NESTA
• SPGL1
• RecPF

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
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Partial inverse of a monotone operator
• A unified primal-dual algorithm framework based on Bregman iteration
• Structured linear algebra problems in adaptive optics imaging
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• New parallel descent-like method for solving a class of variational inequalities
• Two-phase approach for deblurring images corrupted by impulse plus Gaussian noise
• Proximal-point algorithm using a linear proximal term
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A proximal-based deomposition method for compositions method for convex minimization problems
• An algorithm for total variation minimization and applications
• A variational approach to remove outliers and impulse noise
• A note on the alternating direction method of multipliers
• Multiplier and gradient methods
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Fast Multiple-Splitting Algorithms for Convex Optimization
• Digital Image Processing
• An alternating direction method for total variation denoising
• 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?
• Analysis and Generalizations of the Linearized Bregman Method
• Linearized Bregman iterations for compressed sensing
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Rank-Sparsity Incoherence for Matrix Decomposition
• A Parallel Splitting Method for Coupled Monotone Inclusions
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Linearized Bregman Iterations for Frame-Based Image Deblurring
• The Split Bregman Method for L1-Regularized Problems
• Deblurring Images
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
• Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
• Sparsity and Smoothness Via the Fused Lasso
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A splitting method for separable convex programming
• Aspects of Total Variation RegularizedL¹Function Approximation
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Signal Recovery by Proximal Forward-Backward Splitting

This page was built for publication: An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing