A finite Newton method for classification

Optimization Methods and Software

Volumn 17, Issue 5, 2002, Pages 913-929

  Mangasarian, O L ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Classification; Data mining; Newton method; Support vector machines

Indexed keywords

ALGORITHMS; DATA MINING; ITERATIVE METHODS; LEARNING SYSTEMS; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; QUADRATIC PROGRAMMING;

SUPPORT VECTOR MACHINES;

PROBLEM SOLVING;

EID: 0036817951     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678021000028375     Document Type: Article

References (25)

1. L. Armijo (1966). Minimization of functions having Lipschitz-continuous first partial derivatives. Pacific Journal of Mathematics, 16, 1-3.
2. V. Cherkassky and F. Mulier (1998). Learning from Data - Concepts, Theory and Methods. John Wiley & Sons, New York.
3. 1 functions and the Maratos effect. Operations Research Letters, 17, 131-137.
4. G. Fung and O.L. Mangasarian (September 2001). Incremental support vector machine classification. Proceedings of the Second SIAM International Conference on Data Mining, Arlington, Virginia, April 11-13, 2002, R. Grossman, H. Mannila and R. Motwani (editors), SIAM, Philadelphia 2002, 247-260. Technical Report 01-08, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/01-08.ps.
5. G. Fung and O.L. Mangasarian (2001). Proximal support vector machine classifiers. In: F. Provost and R. Srikant (Eds.), Proceedings KDD-2001: Knowledge Discovery and Data Mining, August 26-29, pp. 77-86. Asscociation for Computing Machinery, San Francisco, CA, New York. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/01-02.ps.
6. J.-B. Hiriart-Urruty (1982). Refinements of necessary optimality conditions in nondifferentiable programming II. Mathematical Programming Study, 9, 120-139.
7. L1 data. Applied Mathematics and Optimization, 11, 43-56.
8. C. Kanzow, H. Qi and L. Qi (2001). On the minimum norm solution of linear programs. Journal of Optimization Theory and Applications, to appear. Preprint, University of Hamburg, Hamburg. http://www.math.uni-hamburg.de/home/kanzow/paper.html.
9. 1,1 -optimization problems. Optimization, 19, 169-179.
10. Y.-J. Lee and O.L. Mangasarian (2001). RSVM: reduced support vector machines. Technical Report 00-07, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, July 2000. Proceedings of the First SIAM International Conference on Data Mining, April 5-7. CD-ROM Proceedings, Chicago. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/00-07.ps.
11. Yuh-Jye Lee and O.L. Mangasarian (2001). SSVM: a smooth support vector machine. Computational Optimization and Applications, 20, 5-22. Technical Report 99-03, Data Mining Institute, University of Wisconsin. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/99-03.ps.
12. W. Li and J. Swetits (1999). Regularized Newton methods for minimization of convex quadratic splines with singular hessians. In: M. Fukushima and L. Qi (Eds.), Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 235-257. Kluwer Academic Publishers, Boston.
13. W. Li and J.J. Swetits (1993). A Newton method for convex regression, data smoothing and quadratic programming with bounded constraints. SIAM Journal on Optimization, 3, 466-488.
14. W. Li and J.J. Swetits (1997). A new algorithm for solving strictly convex quadratic programs. SIAM Journal on Optimization, 7, 595-619.
15. K. Madsen and H.B. Nielsen (1998). A finite continuation algortihm for bound constrained quadratic programming. SIAM Journal on Optimization, 9, 62-83.
16. K. Madsen, H.B. Nielsen and M.C. Pinar (1999). Bound constrained quadratic programming via piecewise quadratic functions. Mathematical Programming, 85, 135-156.
17. O.L. Mangasarian (2000). Generalized support vector machines. In: A. Smola, P. Bartlett, B. Schölkopf and D. Schuurmans (Eds.), Advances in Large Margin Classifiers, pp. 135-146. MIT Press, Cambridge, MA. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-14.ps.
18. O.L. Mangasarian and D.R. Musicant (1999). Successive over relaxation for support vector machines. IEEE Transactions on Neural Networks, 10, 1032-1037. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-18.ps.
19. O.L. Mangasarian and D.R. Musicant (2001). Active support vector machine classification. In: Leen K. Todd, Dietterich G. Thomas and Volker Tresp (Eds.), Advances in Neural Information Processing Systems 13, pp. 577-583. MIT Press, Cambridge, MA.ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/00-04.ps.
20. O.L. Mangasarian and D.R. Musicant (2001). Lagrangian support vector machines. Journal of Machine Learning Research, 1, 161-177. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/00-06.ps.
21. J.M. Ortega (1972). Numerical Analysis, A Second Course. Academic Press, New York.
22. 1 optimization problems. Mathematical Programming, 64, 277-294.
23. L. Qi and J. Sun (1993). A nonsmooth version of Newton's method. Mathematical Programming, 58, 353-368.
24. J. Sun (1997). On piecewise quadratic Newton and trust region problems. Mathematical Programming, 76, 451-468.
25. V.N. Vapnik (2000). The Nature of Statistical Learning Theory, 2nd Edn. Springer, New York.