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

DOI10.1090/S0025-5718-2014-02829-9zbMath1311.90100MaRDI 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 processing; convex programming; parallel processing; splitting method; augmented Lagrangian method; separable convex function

Mathematics Subject Classification ID

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

On the convergence rate of the augmented Lagrangian-based parallel splitting method, The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming, 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, Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints, On the Efficiency of Random Permutation for ADMM and Coordinate Descent, Two Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized Version, Dual–primal proximal point algorithms for extended convex programming, A proximal partially parallel splitting method for separable convex programs, 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, Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications, 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, A new parallel splitting augmented Lagrangian-based method for a Stackelberg game, Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints, A new parallel splitting descent method for structured variational inequalities, A parallel splitting method for separable convex programs, A new alternating direction method for linearly constrained nonconvex optimization problems, A note on augmented Lagrangian-based parallel splitting method, Lagrangian penalization scheme with parallel forward-backward splitting, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, A parallel Gauss-Seidel method for convex problems with separable structure, A proximal alternating linearization method for minimizing the sum of two convex functions, A partially isochronous splitting algorithm for three-block separable convex minimization problems, Convergence of ADMM for multi-block nonconvex separable optimization models, 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, Variable splitting based method for image restoration with impulse plus Gaussian noise, 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, An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems, A survey on some recent developments of alternating direction method of multipliers, Improved graph cut model with features of superpixels and neighborhood patches for myocardium segmentation from ultrasound image, Efficient iterative solution of finite element discretized nonsmooth minimization problems, A partially proximal S-ADMM for separable convex optimization with linear constraints, A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization, A proximal alternating direction method for multi-block coupled convex optimization, 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 proximal Peaceman-Rachford splitting method for compressive sensing, A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing, A proximal multiplier method for separable convex minimization, Convergence rate of a proximal multiplier algorithm for separable convex minimization, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming

Uses Software

Cites Work