-
2
-
-
0026923017
-
Very large-scale linear programming: A case study in combining interior point and simplex methods
-
R. E. Bixby, J. W. Gregory, I. J. Lustig, R. E. Marsten, and D. F. Shanno. Very large-scale linear programming: A case study in combining interior point and simplex methods. Operations Research, 40(5):885-897, 1992.
-
(1992)
Operations Research
, vol.40
, Issue.5
, pp. 885-897
-
-
Bixby, R.E.1
Gregory, J.W.2
Lustig, I.J.3
Marsten, R.E.4
Shanno, D.F.5
-
4
-
-
0026966646
-
A training algorithm for optimal margin classifiers
-
D. Haussler, editor, ACM Press
-
B. Boser, I. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In D. Haussler, editor, Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 144-152. ACM Press, 1992.
-
(1992)
Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory
, pp. 144-152
-
-
Boser, B.1
Guyon, I.2
Vapnik, V.N.3
-
5
-
-
80052866161
-
Incremental and decremental support vector machine learning
-
Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, MIT Press
-
G. Cauwenberghs and T. Poggio. Incremental and decremental support vector machine learning. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 409-415. MIT Press, 2001.
-
(2001)
Advances in Neural Information Processing Systems
, vol.13
, pp. 409-415
-
-
Cauwenberghs, G.1
Poggio, T.2
-
7
-
-
0003819899
-
Interior point methods for massive support vector machines
-
00, Computer Sciences Department, University of Wisconsin, Madison, WI
-
M. C. Ferris and T. S. Munson. Interior point methods for massive support vector machines. Technical Report 00-05, Computer Sciences Department, University of Wisconsin, Madison, WI, 2000.
-
(2000)
Technical Report
, Issue.5
-
-
Ferris, M.C.1
Munson, T.S.2
-
8
-
-
0041494125
-
Efficient svm training using low-rank kernel representations
-
S. Fine and K. Scheinberg. Efficient svm training using low-rank kernel representations. Journal of Machine Learning Research, 2:243-264, 2001.
-
(2001)
Journal of Machine Learning Research
, vol.2
, pp. 243-264
-
-
Fine, S.1
Scheinberg, K.2
-
10
-
-
28244491533
-
Mathematical programming with a library of optimization subroutines
-
J. J. Forrest. Mathematical programming with a library of optimization subroutines. Presented at the ORSA/TIMS Joint National Meeting, 1989.
-
(1989)
ORSA/TIMS Joint National Meeting
-
-
Forrest, J.J.1
-
11
-
-
0030284068
-
Solving semidefinite quadratic problems within nonsmooth optimization algorithms
-
A. Frangioni. Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Computers in Operations Research, 23(11): 1099-1118, 1996.
-
(1996)
Computers in Operations Research
, vol.23
, Issue.11
, pp. 1099-1118
-
-
Frangioni, A.1
-
12
-
-
0343970575
-
Extension of newton's method and simplex method for solving quadratic problems
-
F. A. Lootsma, editor, Academic Press, London
-
D. Goldfarb. Extension of newton's method and simplex method for solving quadratic problems. In F. A. Lootsma, editor, Numerical Methods for Nonlinear Optimization, pages 239-254. Academic Press, London, 1972.
-
(1972)
Numerical Methods for Nonlinear Optimization
, pp. 239-254
-
-
Goldfarb, D.1
-
13
-
-
0020826623
-
A numerically stable dual method for solving strictly convex quadratic Programms
-
D. Goldfarb and A. Idnani. A numerically stable dual method for solving strictly convex quadratic Programms. Mathematical Programming, 27:1-33, 1983.
-
(1983)
Mathematical Programming
, vol.27
, pp. 1-33
-
-
Goldfarb, D.1
Idnani, A.2
-
14
-
-
0004236492
-
-
The Johns Hopkins University Press, Baltimore and London, 3rd edition
-
G. H. Golub and Ch. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore and London, 3rd edition, 1996.
-
(1996)
Matrix Computations
-
-
Golub, G.H.1
Van Loan, C.F.2
-
15
-
-
84925605946
-
The entire regularization path
-
T. Hastie, S. Rosset, R. Tibshirani, and J. Zhu. The entire regularization path. Journal of Machine Learning Research, 5:1391-1415, 2004.
-
(2004)
Journal of Machine Learning Research
, vol.5
, pp. 1391-1415
-
-
Hastie, T.1
Rosset, S.2
Tibshirani, R.3
Zhu, J.4
-
16
-
-
0002714543
-
Making large-scale support vector machine nlearning practicle
-
B. Schölkopf, C. C. Burges, and A. J. Smola, editors, chapter 12, MIT Press
-
T. Joachims. Making large-scale support vector machine nlearning practicle. In B. Schölkopf, C. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods, chapter 12, pages 169-184. MIT Press, 1999.
-
(1999)
Advances in Kernel Methods
, pp. 169-184
-
-
Joachims, T.1
-
17
-
-
0001559380
-
Solving the quadratic programming problem arising in support vector classification
-
B. Schölkopf, C. C. Burges, and A. J. Smola, editors, MIT Press
-
L. Kaufman. Solving the quadratic programming problem arising in support vector classification. In B. Schölkopf, C. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods Support Vector Learning, pages 147-168. MIT Press, 1998.
-
(1998)
Advances in Kernel Methods Support Vector Learning
, pp. 147-168
-
-
Kaufman, L.1
-
18
-
-
0000121139
-
A dual method for certain positive semidefinite quadratic programming problems
-
K. C. Kiwiel. A dual method for certain positive semidefinite quadratic programming problems. SIAM Journal on Scientific and Statistical Computing, 10:175-186, 1989.
-
(1989)
SIAM Journal on Scientific and Statistical Computing
, vol.10
, pp. 175-186
-
-
Kiwiel, K.C.1
-
21
-
-
0003120218
-
Fast trining support vector machines using sequential mininal optimization
-
B. Schölkopf, C. C. Burges, and A. J. Smola, editors, chapter 12, MIT Press
-
J. C. Platt. Fast trining support vector machines using sequential mininal optimization. In B. Schölkopf, C. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods, chapter 12, pages 185-208. MIT Press, 1999.
-
(1999)
Advances in Kernel Methods
, pp. 185-208
-
-
Platt, J.C.1
|