Exact and Approximate Sparse Solutions of Underdetermined Linear Equations

DOI10.1137/070686676zbMath1188.90213OpenAlexW1977458753MaRDI QIDQ5189661

Sadegh Jokar, Marc E. Pfetsch

Publication date: 10 March 2010

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/190c904bc39ad060483585b1a6530cb5b4542b4c

zbMATH Keywords

orthogonal matching pursuitbasis pursuitsparse representationsmaximum feasible subsystem problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The maximum feasible subset problem (maxFS) and applications ⋮ A proximal method for composite minimization ⋮ A solution approach for cardinality minimization problem based on fractional programming ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ Faster maximum feasible subsystem solutions for dense constraint matrices ⋮ Sparse recovery with integrality constraints ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Sparse approximate solution of partial differential equations ⋮ Sparse solutions to underdetermined Kronecker product systems

Uses Software

• SCIP