Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration

DOI10.1007/S11081-021-09676-2MaRDI QIDQ2069147zbMATH OpenOpenAlexFDO

Authors Fatih S. Aktaş, Ömer Ekmekcioglu, Mustafa Ç. Pınar

Publication date 20 January 2022

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/77222

zbMATH Keywords

sparse approximationimplicit enumerationinverse problemssparse solutionsbranch and boundoverdetermined linear systemsnon-negative least squares

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Nonconvex programming, global optimization (90C26) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Recommendations

• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
• Fast nonnegative least squares through flexible Krylov subspaces
• The non-convex sparse problem with nonnegative constraint for signal reconstruction
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

Cites work

• scientific article; zbMATH DE number 1906319 (Why is no real title available?)
• scientific article; zbMATH DE number 803211 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• An Introduction to Compressed Sensing
• Best subset selection via a modern optimization lens
• CVXPY: a Python-embedded modeling language for convex optimization
• Convex Analysis
• Estimating Optimal Transformations for Multiple Regression and Correlation
• Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
• Hyperspectral Image Unmixing With Endmember Bundles and Group Sparsity Inducing Mixed Norms
• Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Sparse Approximate Solutions to Linear Systems
• Sparse non-negative super-resolution -- simplified and stabilised
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• The convex geometry of linear inverse problems

Cited in

(5)

• Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• PCA Sparsified
• Optimization methods in inverse problems and applications to science and engineering
• LSSPAR

Describes a project that uses

Uses Software

• Guppy 3
• GitHub
• Python
• CVXPY
• SciPy
• Gurobi
• CPLEX

This page was built for publication: Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration

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