Knowledge-based semidefinite linear programming classifiers

Optimization Methods and Software

Volumn 21, Issue 5, 2006, Pages 693-706

  Jeyakumar, V ^a   Ormerod, J ^a   Womersley, R S ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Ellipsoidal knowledge sets; Semidefinite programming; Set containment characterizations; Support vector machines

Indexed keywords

KNOWLEDGE BASED SYSTEMS; SUPPORT VECTOR MACHINES;

COMPUTATIONAL RESULTS; KNOWLEDGE SET; LARGE-SCALE DATA CLASSIFICATIONS; LINEAR PROGRAMMING PROBLEM; REGULARITY CONDITION; SEMI-DEFINITE PROGRAMMING; SET CONTAINMENT; SOLUTION METHODS;

LINEAR PROGRAMMING;

EID: 77949912475     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500137066     Document Type: Article

References (21)

1. Fung, G., Mangasarian, O.L. and Shavlik, J., 2003, Knowledge-based support vector machine classifiers. In: S. Thurn, S. Becker and K. Obermayer (Eds) Neural Information Processing Systems, Vol. 15 (Cambridge, MA: MIT Press), pp. 521-528.
2. Konno, H., Gotoh, J. and Uryasev, S., 2002, Failure discrimination by semi-definite programming. In: P. Pardalos et al. (Eds) Financial Engineering, Electronic Commerce and Supply Chain (The Netherlands: Kluwer Academic Publishers), pp. 379-396.
3. Osuna, E.E., Freund, R. and Girosi, F., 1997, Support vector machines: training and applications. AI Memo 1602, AI Lab, Massachusetts Institute of Technology, March 1997.
4. nd edn) (NewYork: Springer-Verlag).
5. Mangasarian, O.L., 2004, Knowledge-based linear programming. SIAM Journal on Optimization, 15, 375-382.
6. Schölkopf, C.B. and Vapnik, V., 1996, Incorporating invariances in support vector learning machines. In: Artificial Neural Networks, ICANN'96, Vol. 1112 (Berlin: Springer Lecture Notes in Computer Science), pp. 47-52.
7. Schölkopf, B., Simard, P.Y., Smola, A.J. and Vapnik, V., 1998, Prior knowledge in support vector kernels. In: M.I. Jordan, M.J. Kearns and S.A. Solla (Eds) Advances in Neural Information Processing Systems, Vol. 10 (Cambridge: MIT Press), pp. 640-646.
8. Fung, G.M., Mangasarian, O.L. and Shavlik, J.W., 2003, Knowledge-based nonlinear kernel classifiers. In: M. Warmuth and B. Schölkopf (Eds) Conference Proceedings on Learning Theory (COLT 03) (Berlin: Springer Verlag), pp. 102-113.
9. Helmberg, C., Rendel, F., Vanderbei, R. and Wolkowicz, H., 1996, An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6, 342-361.
10. Ramana, M.V., Tunc¸el, L. and Wolkowicz, H., 1997, Strong duality for semidefinite programming. SIAM Journal on Optimization, 7, 644-662.
11. Nesterov, Y. and Nemirovskii, A., 1994, Interior-point methods in convex programming. Studies in Applied Mathematics, Vol. 13 (Philadelphia, PA: SIAM Publications).
12. Vandenberghe, L. and Boyd, S., 1996, Semidefinite programming. SIAM Review, 38, 49-95.
13. Sturm, J.F., 1999, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimiztion Methods and Software 11-12, 625-653 [Special issue on Interior Point Methods (CD supplement with software)].
14. Mangasarian, O.L., 2005, Support vector machine classification via parameterless robust linear programming. Optimization Methods and Software, 20, 115-125.
15. Horn, R. and Johnson, C., 1985, Matrix Analysis (Cambridge, England: Cambridge University Press).
16. Jeyakumar, V., 2003, Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM Journal on Optimization, 13(4), 947-959.
17. Holmes, R.B., 1975, Geometric Functional Analysis (Berlin, Germany: Springer-Verlag).
18. Jeyakumar, V., Rubinov, A.M., Glover, B.M. and Ishizuka, Y., 1996, Inequality systems and global optimization. Journal on Mathematical Analysis and Application 202, 900-919.
19. th International Conference on Machine Learning, Stanford, US (San Francisco, US: Morgan Kaufmann Publishers), pp. 431-438.
20. Calafiore, G., 2002, Approximation of n-dimensional data using spherical and ellipsoidal primitives. IEEE Transactions on Systems, Man, and Sybernetics Part A: Systems and Humans, 32(2), 269-278.
21. Jeyakumar, V. and Nealon, M., 2000, Complete dual characterization of optimality and feasibility for convex semidefinite programming, constructive, experimental, and nonlinear analysis (Limoges, 1999), CMS Conference Proceedings 27 of American Mathematical Society, Providence, RI, pp. 165-173.