Algorithms for sparsity-constrained optimization

DOI10.1007/978-3-319-01881-2zbMATH Open1282.65066OpenAlexW2390264370MaRDI QIDQ2849653FDOQ2849653

Authors: Sohail Bahmani 

Publication date: 23 September 2013

Published in: Springer Theses (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-01881-2

Recommendations

• Trading accuracy for sparsity in optimization problems with sparsity constraints
• scientific article; zbMATH DE number 6312913
• Gradient projection Newton pursuit for sparsity constrained optimization
• Concave programming for finding sparse solutions to problems with convex constraints
• Greedy sparsity-constrained optimization

zbMATH Keywords

monographloss functionssignal recoverysparsity-constrained optimizationsparse subspaces

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Nonlinear programming (90C30)

Cited In (7)

• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• Sparse Optimization with Least-Squares Constraints
• DC formulations and algorithms for sparse optimization problems
• Greedy sparsity-constrained optimization
• Successive element correction algorithms for sparse unconstrained optimization
• Trading accuracy for sparsity in optimization problems with sparsity constraints
• Algorithm 813

Uses Software

• GRASP

This page was built for publication: Algorithms for sparsity-constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849653)