An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
From MaRDI portal
Publication:293116
DOI10.1007/s10915-015-0078-4zbMath1339.65030OpenAlexW1214677504MaRDI QIDQ293116
Hong-Kun Xu, Hongjin He, Chen Ling
Publication date: 9 June 2016
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-015-0078-4
global convergenceinverse problemlinearizationnumerical experimentsimage reconstructionsignal processingsplitting methodalternating direction method of multipliersproximal point algorithmstatistical learningimage deblurringsplit feasibility problemconvex minimization problem\(\ell_1\)-norm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Two optimization approaches for solving split variational inclusion problems with applications ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ Fast self-adaptive regularization iterative algorithm for solving split feasibility problem ⋮ A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem ⋮ Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems ⋮ The iterative method for solving the proximal split feasibility problem with an application to LASSO problem ⋮ A proximal partially parallel splitting method for separable convex programs
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Alternating direction method of multipliers for sparse principal component analysis
- Fractional Tikhonov regularization for linear discrete ill-posed problems
- Algorithms for the split variational inequality problem
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- A reduced Newton method for constrained linear least-squares problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A multiprojection algorithm using Bregman projections in a product space
- A new inexact alternating directions method for monotone variational inequalities
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A new \(CQ\) method for solving split feasibility problem
- Alternating direction method for covariance selection models
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- On the maximal monotonicity of subdifferential mappings
- A customized proximal point algorithm for convex minimization with linear constraints
- Atomic Decomposition by Basis Pursuit
- Convexly constrained linear inverse problems: iterative least-squares and regularization
- Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers
- Proximal Splitting Methods in Signal Processing
- Linearized Bregman iterations for compressed sensing
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Alternating Direction Method for Image Inpainting in Wavelet Domains
- Matrix completion via an alternating direction method
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- Regularization of linear ill-posed problems by the augmented Lagrangian method and variational inequalities
- The multiple-sets split feasibility problem and its applications for inverse problems
- Nonlinear iterative methods for linear ill-posed problems in Banach spaces
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Sparse Reconstruction by Separable Approximation
- The relaxed CQ algorithm solving the split feasibility problem
- The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem
- Signal Recovery by Proximal Forward-Backward Splitting
- A note on the CQ algorithm for the split feasibility problem
- Navigating in a Graph by Aid of Its Spanning Tree Metric
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
