Pages that link to "Item:Q4265521"
From MaRDI portal
The following pages link to Minimum-support solutions of polyhedral concave programs<sup>*</sup> (Q4265521):
Displaying 8 items.
- A proximal method for composite minimization (Q304260) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\) (Q650241) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- Weak Stability of <i>ℓ</i><sub>1</sub>-Minimization Methods in Sparse Data Reconstruction (Q5219713) (← links)
- The Geometry of Sparse Analysis Regularization (Q6158006) (← links)
