FPC_AS

swMATH12218MaRDI QIDQ24149FDOQ24149

Author name not available (Why is that?)

Described by source

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

Cited In (73)

• An efficient proximal block coordinate homotopy method for large-scale sparse least squares problems
• An active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint
• Search direction correction with normalized gradient makes first-order methods faster
• An active set Newton-CG method for \(\ell_1\) optimization
• A three-operator splitting algorithm for nonconvex sparsity regularization
• Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
• A simple homotopy proximal mapping algorithm for compressive sensing
• 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
• A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
• A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression
• An active set algorithm for nonlinear optimization with polyhedral constraints
• A cyclic projected gradient method
• 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
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• 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
• A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering
• ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
• ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
• Stochastic variance reduced gradient methods using a trust-region-like scheme
• Matrix-free interior point method for compressed sensing problems
• Sparse signal reconstruction via iterative support detection
• Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
• An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• Efficient sparse semismooth Newton methods for the clustered Lasso problem
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems
• Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
• 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
• A proximal gradient method for ensemble density functional theory
• Global convergence of proximal iteratively reweighted algorithm
• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• A unified approach for minimizing composite norms
• Concave programming for finding sparse solutions to problems with convex constraints
• A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
• A survey on compressive sensing: classical results and recent advancements
• A Barzilai-Borwein type method for minimizing composite functions
• A hybrid finite-dimensional RHC for stabilization of time-varying parabolic equations
• New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications
• A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
• Solving basis pursuit: heuristic optimality check and solver comparison
• A decomposition method for Lasso problems with zero-sum constraint
• Gradient-based method with active set strategy for \(\ell _1\) optimization
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
• A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization
• NESTA: A fast and accurate first-order method for sparse recovery
• Templates for convex cone problems with applications to sparse signal recovery
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
• Minimization of \(\ell_{1-2}\) for compressed sensing
• An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
• Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
• An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
• Decomposable norm minimization with proximal-gradient homotopy algorithm
• An algorithm solving compressive sensing problem based on maximal monotone operators
• IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
• A first-order augmented Lagrangian method for compressed sensing
• Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
• Heat source identification based on \(\ell_1\) constrained minimization

This page was built for software: FPC_AS