A sequential updating scheme of the Lagrange multiplier for separable convex programming

DOI10.1090/mcom/3104zbMath1348.90520OpenAlexW2339339405MaRDI QIDQ2826683

Deren Han, Wenxing Zhang, Yu-Hong Dai, Xiao-Ming Yuan

Publication date: 18 October 2016

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

Full work available at URL: https://doi.org/10.1090/mcom/3104

zbMATH Keywords

image processingconvex programmingsplitting methodaugmented Lagrangian methodmethod of multipliers

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Parallel algorithms in computer science (68W10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

Fast algorithms for sparse inverse covariance estimation ⋮ A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems ⋮ Infimal convolution regularisation functionals of BV and \(\mathrm{L}^p\) spaces. I: The finite \(p\) case ⋮ Approximation Schemes for Materials with Discontinuities ⋮ Customized alternating direction methods of multipliers for generalized multi-facility Weber problem ⋮ Randomized algorithms for orthogonal nonnegative matrix factorization ⋮ Alternating direction method of multipliers for linear hyperspectral unmixing ⋮ A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming ⋮ Efficient iterative solution of finite element discretized nonsmooth minimization problems ⋮ A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization ⋮ A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming ⋮ 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 ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems ⋮ Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 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
• Modeling textures with total variation minimization and oscillating patterns in image processing
• A new inexact alternating directions method for monotone variational inequalities
• A note on the alternating direction method of multipliers
• A survey on the continuous nonlinear resource allocation problem
• Structure-texture image decomposition -- modeling, algorithms, and parameter selection
• Multiplier and gradient methods
• A Low Patch-Rank Interpretation of Texture
• Proximal Splitting Methods in Signal Processing
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• The Split Bregman Method for L1-Regularized Problems
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Market Mechanisms and Mathematical Programming
• Deblurring Images
• Image decomposition via the combination of sparse representations and a variational approach
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
• Image Decomposition and Restoration Using Total Variation Minimization and theH¹
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A Generalized Proximal Point Algorithm and Its Convergence Rate
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Proximité et dualité dans un espace hilbertien
• Convex analysis and monotone operator theory in Hilbert spaces
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: A sequential updating scheme of the Lagrange multiplier for separable convex programming