An implementable splitting algorithm for the _1-norm regularized split feasibility problem
From MaRDI portal
Publication:293116
DOI10.1007/S10915-015-0078-4zbMATH Open1339.65030OpenAlexW1214677504MaRDI QIDQ293116FDOQ293116
Authors: Hongjin He, Chen Ling, Hong-Kun Xu 
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
Recommendations
- Regularization for the split feasibility problem
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- Regularized methods for the split feasibility problem
- Splitting methods for split feasibility problems with application to Dantzig selectors
- Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
alternating direction method of multipliersinverse problemsignal processingstatistical learningglobal convergencenumerical experimentsimage deblurringimage reconstructionconvex minimization problemlinearizationproximal point algorithmsplit feasibility problemsplitting method\(\ell_1\)-norm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Title not available (Why is that?)
- Alternating direction method of multipliers for sparse principal component analysis
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Compressed sensing
- A multiprojection algorithm using Bregman projections in a product space
- Proximal splitting methods in signal processing
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- Sparse Reconstruction by Separable Approximation
- Signal Recovery by Proximal Forward-Backward Splitting
- Algorithms for the split variational inequality problem
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Alternating direction method for covariance selection models
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Linearized Bregman iterations for compressed sensing
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Matrix completion via an alternating direction method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new inexact alternating directions method for monotone variational inequalities
- On the maximal monotonicity of subdifferential mappings
- A customized proximal point algorithm for convex minimization with linear constraints
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Nonlinear iterative methods for linear ill-posed problems in Banach spaces
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- The linearized alternating direction method of multipliers for Dantzig selector
- A note on the CQ algorithm for the split feasibility problem
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- Alternating direction method for image inpainting in wavelet domains
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- Atomic decomposition by basis pursuit
- Gradient-based algorithms with applications to signal-recovery problems
- Solving large-scale least squares semidefinite programming by alternating direction methods
- Convexly constrained linear inverse problems: Iterative least-squares and regularization
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- A new \(CQ\) method for solving split feasibility problem
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Regularization of linear ill-posed problems by the augmented Lagrangian method and variational inequalities
- Fractional Tikhonov regularization for linear discrete ill-posed problems
- Linearized alternating direction method for constrained linear least-squares problem.
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- A reduced Newton method for constrained linear least-squares problems
Cited In (21)
- Strong convergence of split equality variational inequality, variational inclusion, and multiple sets fixed point problems in Hilbert spaces with application
- Regularized methods for the split feasibility problem
- The relaxed projection methods for solving the \({l_1}\)-norm problem of linear equations and their applications
- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
- Two optimization approaches for solving split variational inclusion problems with applications
- Splitting methods for split feasibility problems with application to Dantzig selectors
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- A 2-block semi-proximal ADMM for solving the H-weighted nearest correlation matrix problem
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- Modified general splitting method for the split feasibility problem
- Regularization for the split feasibility problem
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- A dynamical system method for solving the split convex feasibility problem
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- A dynamical system with fixed-time convergence for solving the split feasibility problem and applications to signal recovery
- A new fixed-time stability of neural network to solve split convex feasibility problems
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- A proximal partially parallel splitting method for separable convex programs
- A proximal alternating direction method of multipliers for DC programming with structured constraints
- \(l_1\)-\(l_2\) regularization of split feasibility problems
Uses Software
This page was built for publication: An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293116)
