Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem

DOI10.4208/eajam.270812.161112azbMath1284.68624OpenAlexW2335166083MaRDI QIDQ5406928

Min Tao, Xiao-Ming Yuan, Raymond Honfu Chan

Publication date: 4 April 2014

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.270812.161112a

zbMATH Keywords

linearizationimage processingalternating direction methodlinear least-squares problems

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (12)

An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing ⋮ An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems ⋮ Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step ⋮ Convergence study on the proximal alternating direction method with larger step size ⋮ A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems ⋮ TGV-based multiplicative noise removal approach: models and algorithms ⋮ Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks ⋮ A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fast minimization methods for solving constrained total-variation superresolution image reconstruction
• A reduced Newton method for constrained linear least-squares problems
• 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
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• Numerical methods for generalized least squares problems
• Interactive decision support in radiation therapy treatment planning
• An iterative method for linear discrete ill-posed problems with box constraints
• Multiplier and gradient methods
• 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 Method for Image Inpainting in Wavelet Domains
• A Fast Total Variation Minimization Method for Image Restoration
• The Split Bregman Method for L1-Regularized Problems
• An interior point Newton-like method for non-negative least-squares problems with degenerate solution
• Two-Point Step Size Gradient Methods
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
• Conjugate Gradient Methods for Toeplitz Systems
• An interior-point trust-region-based method for large-scale non-negative regularization
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• Non-negativity and iterative methods for ill-posed problems

This page was built for publication: Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem