Minimum-support solutions of polyhedral concave programs

Optimization

Volumn 45, Issue 1-4, 1999, Pages 149-162

  Mangasarian, O L ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Concave minimization; Linear complementarity problems; Linear programs; Minimum support solutions

Indexed keywords

EID: 22644449712     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939908844431     Document Type: Article

References (22)

1. Bradley, P. S., Usama, M. Fayyad and Mangasarian, O. L. Data mining: Overview and optimization opportunities. Technical Report 98-01, Computer Sciences Departments, University of Wisconsin, Madison, Wisconsin, January, 1998. INFORMS Journal on Computing, to appear. Available from: ftp://ftp.cs.wisc.du/math-prog/tech-reports/98-01.ps.Z.
2. Bradley, P. S., Mangasarian, O. L. and Rosen, J. B. Parsimonious least norm approximation. Technical Report 97-03, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, March, 1997 Computational Optimization and Applications, to appear, ftp://ftp.cs.wisc.edu/math-prog/tech-reports/97-03.ps Z.
3. Bradley, P. S., Mangasarian, O. L. and Street, W. N. (1998). Feature selection via mathematical programming. INFORMS Journal on Computing, to appear. Available at ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-21. ps.Z.
4. Burges, C. J. C., Simplified support vector decision rules. In: Saita, L. Ed., Machine Learning-Proceedings of the Thirteenth International Conference, (ICML'96)-Bari, Italy, July 1996, 3-6, pp. 71-77, San Francisco, CA, Morgan Kaufmann.
5. Chung, S.-J. (1989). NP-completeness of the linear complementarity problem. Journal of Optimization Theory and Applications, 60, 393-399.
6. Cottle, R. W., Pang, J.-S. and Stone, R. E. (1992). The Linear Complementarity Problem, Academic Press, New York.
7. Drucker, H., Burges, C. J. C., Kaufman, L., Smola, A. and Vapnik, V. (1997). Support vector regression machines. In: Mozer, M. C., Jordan, M. I. and Petsche, T. (Eds.), Advances in Neural Information Processing Systems-9, pp. 155-161, Cambridge, MA, MIT Press.
8. Han, S.-P. and Mangasarian, O. L. (1979). Exact penalty functions in nonlinear programming. Mathematical Programming, 17, 251-269.
9. Mangasarian, O. L. (1978). Characterization of linear complementarity problems as linear programs. Mathematical Programming Study, 7, 74-87.
10. Mangasarian, O. L. (1985). Simple computable bounds for solutions of linear complementarity problems and linear programs. Mathematical Programming Study, 25, 1-12.
11. Mangasarian, O. L. (1986). Some applications of penalty functions in mathematical programming. In: Conti, R., De Giorgi, E. and Giannessi, F. (Eds.) Optimization and Related Fields, pp. 307-329. Springer-Verlag, Heidelberg, Lecture Notes in Mathematics, pp. 1190.
12. Mangasarian, O. L. (1988). A simple characterization of solution sets of convex programs. Operations Research Letters, 7(1), 21-26.
13. Mangasarian, O. L. (1994). Misclassification minimization. Journal of Global Optimization, 5, 309-323.
14. Mangasarian, O. L. (1996). Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B. and Schaeffler, S. (Eds.) Applied Mathematics and Parallel Computing-Festschrift for Klaus Ritter, pp. 175-188. Physica-Verlag A Springer-Verlag Company, Hei-delberg, Available at ftp://ftp.cs.wisc.edu/math-prog/tech-reports/ 95-20. ps.Z.
15. Mangasarian, O. L. (1997). Mathematical programming in data mining. Data Mining and Knowledge Discovery, 1(2), 183-201. Available at ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-05.ps.Z.
16. Mangasarian, O. L. (1997). Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Mathematica Vietnamica, 22(1), 199-205, Available at ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-10.ps.Z.
17. Mangasarian, O. L. and Pang, J.-S. (1997). Exact penalty functions for mathematical programs with linear complementarity constraints. Optimization, 42, 1-8, Available from: ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-06.ps.Z.
18. Polyak, B. T. (1987). Introduction to Optimization, Optimization Software, Inc., Publications Division, New York.
19. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press, Princeton, New Jersey.
20. Vapnik, V. N. (1995). The Nature of Statistical Learning Theory, Springer, New York.
21. Wolpert, D. H. (1992). On the connection between in-sample testing and generalization error. Complex Systems, 6, 47-94.
22. Wolpert, D. H. (Ed.) (1995). The Mathematics of Generalization, Reading, MA, Addison-Wesley.