Minimum-support solutions of polyhedral concave programs*

DOI10.1080/02331939908844431zbMath0945.90042MaRDI QIDQ4265521

Olvi L. Mangasarian

Publication date: 22 September 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/66039

zbMATH Keywords

concave minimization; linear complementarity problems; linear programs; minimum-support solutions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90C05: Linear programming

49M37: Numerical methods based on nonlinear programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Unsupervised classification via convex absolute value inequalities, Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction, Combined SVM-based feature selection and classification, Combined SVM-based feature selection and classification, Sparse approximation over the cube, The Geometry of Sparse Analysis Regularization, A proximal method for composite minimization, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\), Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, Knapsack feasibility as an absolute value equation solvable by successive linear programming, A solution approach for cardinality minimization problem based on fractional programming, Sparse optimization in feature selection: application in neuroimaging, Minimal Multiset Grammars for Recurrent Dynamics, Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets, Support vector machine classification with noisy data: a second order cone programming approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-completeness of the linear complementarity problem
• A simple characterization of solutions sets of convex programs
• Misclassification minimization
• Exact penalty functions in nonlinear programming
• Exact penalty for mathematical programs with linear complementarity constraints
• Mathematical Programming for Data Mining: Formulations and Challenges
• Convex Analysis