Cited in
(only showing first 100 items - show all)- Templates for convex cone problems with applications to sparse signal recovery
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- MINQ8
- An algorithm solving compressive sensing problem based on maximal monotone operators
- A first-order augmented Lagrangian method for compressed sensing
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- A simple homotopy proximal mapping algorithm for compressive sensing
- Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
- Heat source identification based on \(\ell_1\) constrained minimization
- Nomonotone spectral gradient method for sparse recovery
- Proximal Newton-type methods for minimizing composite functions
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Analysis and generalizations of the linearized Bregman method
- An active set algorithm for nonlinear optimization with polyhedral constraints
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
- A cyclic projected gradient method
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A proximal-gradient homotopy method for the sparse least-squares problem
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- A truncated Newton algorithm for nonconvex sparse recovery
- An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- Sequential sparse Bayesian learning with applications to system identification for damage assessment and recursive reconstruction of image sequences
- A first-order smoothed penalty method for compressed sensing
- On the convergence of an active-set method for \(\ell_1\) minimization
- New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Search direction correction with normalized gradient makes first-order methods faster
- A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
- Stochastic variance reduced gradient methods using a trust-region-like scheme
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- Matrix-free interior point method for compressed sensing problems
- Sparse signal reconstruction via iterative support detection
- DSPCA
- NNLS
- PDCO
- BLOOMP
- NESTA
- KSSOLV
- Sparco
- ParNes
- CoSaMP
- SPGL1
- iPiano
- ABC-SubSim
- CurveLab
- Yall1
- SparseLOGREG
- FTVd
- L1-MAGIC
- SLEP
- l1_ls
- CYCLADES
- Spline Toolbox
- OSGA
- coneproj
- SPIRAL
- biglasso
- FPC
- IMRO
- L1TestPack
- PNOPT
- SpaRSA
- TwIST
- PPROJ
- GESPAR
- ADMM
- CGIST
- ProxSARAH
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- An active set Newton-CG method for \(\ell_1\) optimization
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
- Global convergence of proximal iteratively reweighted algorithm
- A unified approach for minimizing composite norms
- A proximal gradient method for ensemble density functional theory
- Concave programming for finding sparse solutions to problems with convex constraints
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
- A Barzilai-Borwein type method for minimizing composite functions
- A survey on compressive sensing: classical results and recent advancements
This page was built for software: FPC_AS
