Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
From MaRDI portal
Publication:3395007
DOI10.1137/070698920zbMath1180.65076OpenAlexW2009702064MaRDI QIDQ3395007
Wotao Yin, E. T. Hale, Yin Zhang
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070698920
convergencenumerical resultsoperator splittingcontinuation methodcompressed sensingpath-following method\(l_1\) regularizationfix-point algorithmlarge-scale \(l_1\) regularized convex minimization problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Related Items
\(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems, Proximal Splitting Methods in Signal Processing, Fast sparse reconstruction: Greedy inverse scale space flows, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems, On the convergence of an active-set method for ℓ1minimization, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization, An algorithm for quadratic ℓ1-regularized optimization with a flexible active-set strategy, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Regularized sparse representation for image deconvolution, Iterative positive thresholding algorithm for non-negative sparse optimization, Local linear convergence of a primal-dual algorithm for the augmented convex models, Nonlinear regularization techniques for seismic tomography, A Greedy Algorithm for Sparse Precision Matrix Approximation, A provably convergent scheme for compressive sensing under random generative priors, An active set Newton-CG method for \(\ell_1\) optimization, Smoothing strategy along with conjugate gradient algorithm for signal reconstruction, The modified accelerated Bregman method for regularized basis pursuit problem, A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing, Convex optimization approach to signals with fast varying instantaneous frequency, On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals, Quadratic growth conditions and uniqueness of optimal solution to Lasso, Convergence rates of accelerated proximal gradient algorithms under independent noise, Sparse broadband beamformer design via proximal optimization Techniques, Another hybrid approach for solving monotone operator equations and application to signal processing, A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares, A nonconvex approach to low-rank matrix completion using convex optimization, Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem, Thresholding gradient methods in Hilbert spaces: support identification and linear convergence, A simple homotopy proximal mapping algorithm for compressive sensing, Accelerated matrix completion algorithm using continuation strategy and randomized SVD, A separable surrogate function method for sparse and low-rank matrices decomposition, Rumor transmission in online social networks under Nash equilibrium of a psychological decision game, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Activity Identification and Local Linear Convergence of Forward--Backward-type Methods, Gradient-based method with active set strategy for $\ell _1$ optimization, On FISTA with a relative error rule, Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data, Efficient algorithms for robust and stable principal component pursuit problems, Convergence rate analysis of proximal gradient methods with applications to composite minimization problems, Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, ELASTIC-NET REGULARIZATION FOR LOW-RANK MATRIX RECOVERY, A Projection Proximal-Point Algorithm for ℓ1Minimization, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, An alternating direction method for linear‐constrained matrix nuclear norm minimization, Local linear convergence analysis of Primal–Dual splitting methods, Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization, A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares, Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization, A New Algorithm Framework for Image Inpainting in Transform Domain, Low Complexity Regularization of Linear Inverse Problems, An iterative algorithm for third-order tensor multi-rank minimization, Elastic-Net Regularization: Iterative Algorithms and Asymptotic Behavior of Solutions, A parallel line search subspace correction method for composite convex optimization, An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm, A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs, A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization, Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition, COMPRESSED SENSING BY ITERATIVE THRESHOLDING OF GEOMETRIC WAVELETS: A COMPARING STUDY, CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Compact dictionary pair learning and refining based on principal components analysis, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, CT image reconstruction algorithms based on the Hanke Raus parameter choice rule, Unnamed Item, A time continuation based fast approximate algorithm for compressed sensing related optimization, A Proximal Gradient Method for Ensemble Density Functional Theory, Minimization of $\ell_{1-2}$ for Compressed Sensing, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, Forward–backward-based descent methods for composite variational inequalities, Primal–dual first-order methods for a class of cone programming, An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint, An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, Implicit regularization with strongly convex bias: Stability and acceleration, A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring, A linearly convergent algorithm for sparse signal reconstruction, A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem, Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, Wavelet inpainting with the \(\ell_{0}\) sparse regularization, A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem, A proximal method for composite minimization, A family of second-order methods for convex \(\ell _1\)-regularized optimization, Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization, Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering, Reweighted minimization model for MR image reconstruction with split Bregman method, Sparse microwave imaging: principles and applications, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Robust subspace segmentation via nonconvex low rank representation, Fast alternating linearization methods for minimizing the sum of two convex functions, A unified approach to error bounds for structured convex optimization problems, A total fractional-order variation model for image super-resolution and its SAV algorithm, Sparse constrained reconstruction for accelerating parallel imaging based on variable splitting method, Two-step version of fixed point continuation method for sparse reconstruction, The convex geometry of linear inverse problems, Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector, Sparse identification of posynomial models, Alternating direction augmented Lagrangian methods for semidefinite programming, Noisy 1-bit compressive sensing: models and algorithms, Sampling in the analysis transform domain, Gene selection and prediction for cancer classification using support vector machines with a reject option, Adaptive decomposition-based evolutionary approach for multiobjective sparse reconstruction, Error forgetting of Bregman iteration, Accelerated linearized Bregman method, Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization, Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, Iterative regularization via dual diagonal descent, Matrix completion for matrices with low-rank displacement, A unified primal-dual algorithm framework based on Bregman iteration, Majorization-minimization algorithms for nonsmoothly penalized objective functions, New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications, Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations, Accelerating near-field 3D imaging approach for joint high-resolution imaging and phase error correction, Proximal methods for the latent group lasso penalty, An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints, Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing, First-order optimality condition of basis pursuit denoise problem, Domain decomposition methods for nonlocal total variation image restoration, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, Bregman reweighted alternating minimization and its application to image deblurring, A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem, A new generalized shrinkage conjugate gradient method for sparse recovery, A Barzilai-Borwein type method for minimizing composite functions, Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal, A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion, Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing, A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems, ADMM-softmax: an ADMM approach for multinomial logistic regression, Decomposable norm minimization with proximal-gradient homotopy algorithm, DC programming and DCA: thirty years of developments, Sparse decomposition by iterating Lipschitzian-type mappings, Modified algorithms for image inpainting in Fourier transform domain, On the proximal gradient algorithm with alternated inertia, Convergence of iterative hard-thresholding algorithm with continuation, An extragradient-based alternating direction method for convex minimization, Convergence of projected Landweber iteration for matrix rank minimization, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, An alternating direction algorithm for matrix completion with nonnegative factors, A new spectral method for \(l_1\)-regularized minimization, Convergence of fixed-point continuation algorithms for matrix rank minimization, Low-rank and sparse matrices fitting algorithm for low-rank representation, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, Templates for convex cone problems with applications to sparse signal recovery, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, A projection method for convex constrained monotone nonlinear equations with applications, A new linearized split Bregman iterative algorithm for image reconstruction in sparse-view X-ray computed tomography, A non-adapted sparse approximation of PDEs with stochastic inputs, Extragradient thresholding methods for sparse solutions of co-coercive ncps, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Projected Landweber iteration for matrix completion, Restoration of images corrupted by mixed Gaussian-impulse noise via \(l_{1}-l_{0}\) minimization, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, A penalty decomposition method for rank minimization problem with affine constraints, Projective robust nonnegative factorization, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Variable splitting based method for image restoration with impulse plus Gaussian noise, Pairwise constraint propagation via low-rank matrix recovery, Sparse recovery via differential inclusions, Fast global convergence of gradient methods for high-dimensional statistical recovery, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, Modified three-term conjugate gradient method and its applications, Low-rank elastic-net regularized multivariate Huber regression model, A residual-based algorithm for solving a class of structured nonsmooth optimization problems, An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization, Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem, An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction, A linearly convergent algorithm without prior knowledge of operator norms for solving \(\ell_1 - \ell_2\) minimization, Mixture augmented Lagrange multiplier method for tensor recovery and its applications, Accelerated augmented Lagrangian method for total variation minimization, A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications, Mixed linear system estimation and identification, Proximal gradient method for huberized support vector machine, Nomonotone spectral gradient method for sparse recovery
