Linearized alternating direction method for constrained linear least-squares problem.
From MaRDI portal
Publication:5406928
DOI10.4208/EAJAM.270812.161112AzbMATH Open1284.68624OpenAlexW2335166083MaRDI QIDQ5406928FDOQ5406928
Authors: Raymond H. Chan, Min Tao, Xiaoming Yuan 
Publication date: 4 April 2014
Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/eajam.270812.161112a
Recommendations
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Alternating direction method of multipliers for linear inverse problems
- A reduced Newton method for constrained linear least-squares problems
- A general framework for ADMM acceleration
- Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Numerical solution to inverse problems in abstract spaces (65J22) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- 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
- Two-Point Step Size Gradient Methods
- The Split Bregman Method for L1-Regularized Problems
- Multiplier and gradient methods
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- A new inexact alternating directions method for monotone variational inequalities
- Title not available (Why is that?)
- Conjugate Gradient Methods for Toeplitz Systems
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Alternating direction method for image inpainting in wavelet domains
- A Fast Total Variation Minimization Method for Image Restoration
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Non-negativity and iterative methods for ill-posed problems
- Numerical methods for generalized least squares problems
- A reduced Newton method for constrained linear least-squares problems
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- An interior-point trust-region-based method for large-scale non-negative regularization
- Fast minimization methods for solving constrained total-variation superresolution image reconstruction
- An iterative method for linear discrete ill-posed problems with box constraints
- Interactive decision support in radiation therapy treatment planning
Cited In (19)
- A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography
- Linearized block-wise alternating direction method of multipliers for multiple-block convex programming
- Alternating direction method of multipliers for linear hyperspectral unmixing
- An ADMM based method for underdetermined box-constrained integer least squares problems
- TGV-based multiplicative noise removal approach: models and algorithms
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems
- An approximate alternating linearization decomposition method
- A reduced Newton method for constrained linear least-squares problems
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- Generalized Peaceman-Rachford splitting method for separable convex programming with applications to image processing
- Convergence study of indefinite proximal ADMM with a relaxation factor
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- 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
- Title not available (Why is that?)
- An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
- An efficient iterative method for solving a class of constrained tensor least squares problem
This page was built for publication: Linearized alternating direction method for constrained linear least-squares problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406928)
