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 active-set proximal quasi-Newton algorithm for ℓ₁-regularized minimization over a sphere constraint
• A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization
• Exact Penalty Function for $\ell_{2,1}$ Norm Minimization over the Stiefel Manifold
• An active set Newton-CG method for \(\ell_1\) optimization
• Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster
• An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems
• A simple homotopy proximal mapping algorithm for compressive sensing
• Nomonotone spectral gradient method for sparse recovery
• 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 Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering
• A new generalized shrinkage conjugate gradient method for sparse recovery
• 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
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
• 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
• Sparse Signal Reconstruction via Iterative Support Detection
• On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
• A truncated Newton algorithm for nonconvex sparse recovery
• On the convergence of an active-set method for ℓ₁minimization
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• Proximal Newton-Type Methods for Minimizing Composite Functions
• Sequential sparse Bayesian learning with applications to system identification for damage assessment and recursive reconstruction of image sequences
• A Proximal Gradient Method for Ensemble Density Functional Theory
• Gradient-based method with active set strategy for $\ell _1$ optimization
• 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
• A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations
• ``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
• Analysis and Generalizations of the Linearized Bregman Method
• Matrix-free interior point method for compressed sensing problems
• Solving Basis Pursuit
• 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
• An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• An interior stochastic gradient method for a class of non-Lipschitz optimization problems
• Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• A regularized semi-smooth Newton method with projection steps for composite convex programs
• 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 Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• A First-Order Smoothed Penalty Method for Compressed Sensing
• A unified approach for minimizing composite norms
• Concave programming for finding sparse solutions to problems with convex constraints
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems
• A survey on compressive sensing: classical results and recent advancements
• A Barzilai-Borwein type method for minimizing composite functions
• 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
• A decomposition method for Lasso problems with zero-sum constraint
• A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
• A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization
• Templates for convex cone problems with applications to sparse signal recovery
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
• 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
• A first-order augmented Lagrangian method for compressed sensing
• Heat source identification based on \(\ell_1\) constrained minimization

This page was built for software: FPC_AS