Pages that link to "Item:Q5189661"
From MaRDI portal
The following pages link to Exact and Approximate Sparse Solutions of Underdetermined Linear Equations (Q5189661):
Displaying 10 items.
- A proximal method for composite minimization (Q304260) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- The complexity results of the sparse optimization problems and reverse convex optimization problems (Q2228394) (← links)
- Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
