Minimum-support solutions of polyhedral concave programs*

DOI10.1080/02331939908844431zbMath0945.90042OpenAlexW1992155810MaRDI 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 minimizationlinear complementarity problemslinear programsminimum-support solutions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

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

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