Gradient-based method with active set strategy for _1 optimization
From MaRDI portal
Gradient-based method with active set strategy for \(\ell 1\) optimization
Recommendations
- An active set Newton-CG method for \(\ell_1\) optimization
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- A second-order method for convex _1-regularized optimization with active-set prediction
- On the convergence of an active-set method for _1 minimization
- An algorithm for quadratic _1-regularized optimization with a flexible active-set strategy
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A coordinate gradient descent method for nonsmooth separable minimization
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order augmented Lagrangian method for compressed sensing
- A first-order smoothed penalty method for compressed sensing
- A new analysis on the Barzilai-Borwein gradient method
- A Nonmonotone Line Search Technique for Newton’s Method
- A second-order method for convex _1-regularized optimization with active-set prediction
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Adaptive greedy approximations
- An EM algorithm for wavelet-based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Benchmarking optimization software with performance profiles.
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Compressed sensing
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Gradient-based methods for sparse recovery
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Local linear convergence of the alternating direction method of multipliers on quadratic or linear programs
- Nonmonotone spectral method for large-scale symmetric nonlinear equations
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the convergence of an active-set method for _1 minimization
- On the Identification of Active Constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Sparse Reconstruction by Separable Approximation
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Stable recovery of sparse overcomplete representations in the presence of noise
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(14)- Second-order orthant-based methods with enriched Hessian information for sparse \(\ell _1\)-optimization
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- A truncated Newton algorithm for nonconvex sparse recovery
- Improved SVRG for finite sum structure optimization with application to binary classification
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- An active set Newton-CG method for \(\ell_1\) optimization
- A second-order method for convex _1-regularized optimization with active-set prediction
- An inexact quasi-Newton algorithm for large-scale \(\ell_1\) optimization with box constraints
- A dual active set method for \(\ell1\)-regularized problem
- An active set strategy based on the multiplier function or the gradient.
- A random active set method for strictly convex quadratic problem with simple bounds
- A nonmonotone proximal point algorithm for nonconvex regularized optimization with box constraints
This page was built for publication: Gradient-based method with active set strategy for \(\ell _1\) optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605700)
