FPC_AS

MaRDI QIDQ24149swMATHFDO

Official website http://www.caam.rice.edu/~optimization/L1/FPC_AS/

Described by source

• A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation

Cited in

(only showing first 100 items - show all)

• DeepCoDA
• as-zsl
• RobRegCC
• ConstrainedLasso
• Inertial-SsGM
• A regularized semi-smooth Newton method with projection steps for composite convex programs
• Global convergence of proximal iteratively reweighted algorithm
• NNLS
• DSPCA
• PDCO
• Templates for convex cone problems with applications to sparse signal recovery
• BLOOMP
• NESTA
• KSSOLV
• Sparco
• A cyclic projected gradient method
• New nonsmooth equations-based algorithms for _1-norm minimization and applications
• An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
• Stochastic variance reduced gradient methods using a trust-region-like scheme
• Sequential sparse Bayesian learning with applications to system identification for damage assessment and recursive reconstruction of image sequences
• SPGL1
• ParNes
• CoSaMP
• A decomposition method for Lasso problems with zero-sum constraint
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• A truncated Newton algorithm for nonconvex sparse recovery
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
• iPiano
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems
• ABC-SubSim
• CurveLab
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
• Yall1
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
• ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
• SparseLOGREG
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• FTVd
• A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
• A simple homotopy proximal mapping algorithm for compressive sensing
• L1-MAGIC
• Heat source identification based on \(\ell_1\) constrained minimization
• A unified approach for minimizing composite norms
• Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization
• SLEP
• Nomonotone spectral gradient method for sparse recovery
• l1_ls
• An active set Newton-CG method for \(\ell_1\) optimization
• Spline Toolbox
• CYCLADES
• A fast active set block coordinate descent algorithm for _1-regularized least squares
• A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
• OSGA
• A proximal-gradient homotopy method for the sparse least-squares problem
• On the convergence of an active-set method for _1 minimization
• A first-order augmented Lagrangian method for compressed sensing
• Proximal Newton-type methods for minimizing composite functions
• A first-order smoothed penalty method for compressed sensing
• SPIRAL
• Analysis and generalizations of the linearized Bregman method
• Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
• NESTA: A fast and accurate first-order method for sparse recovery
• Concave programming for finding sparse solutions to problems with convex constraints
• A family of second-order methods for convex \(\ell _1\)-regularized optimization
• biglasso
• Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
• IMRO
• TwIST
• SpaRSA
• FPC
• PNOPT
• L1TestPack
• PPROJ
• Search direction correction with normalized gradient makes first-order methods faster
• An active set algorithm for nonlinear optimization with polyhedral constraints
• coneproj
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• GESPAR
• ADMM
• CGIST
• Gradient-based method with active set strategy for \(\ell _1\) optimization
• A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
• ProxSARAH
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
• A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
• A Barzilai-Borwein type method for minimizing composite functions
• Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
• A three-operator splitting algorithm for nonconvex sparsity regularization
• Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
• An algorithm solving compressive sensing problem based on maximal monotone operators
• Decomposable norm minimization with proximal-gradient homotopy algorithm
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
• Efficient sparse semismooth Newton methods for the clustered Lasso problem
• On quasi-Newton forward-backward splitting: proximal calculus and convergence
• A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization
• A hybrid finite-dimensional RHC for stabilization of time-varying parabolic equations
• Minimization of \(\ell_{1-2}\) for compressed sensing

This page was built for software: FPC_AS