Linear Programming: Foundations and Extensions (1996)

by Robert J. Vanderbei
Citations:139 - 0 self

Documents Related by Co-Citation

8950 The Nature of Statistical Learning Theory – Vladimir N. Vapnik - 1995
3279 Convex Analysis – R. Tyrrell Rockafellar - 1970
217 Interior Point Algorithms: Theory and Analysis – Y Ye - 1997
482 Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization – Farid Alizadeh - 1993
254 Interior Point Polynomial Methods in Convex Programming – Y Nesterov, A Nemirovskii - 1994
198 A new polynomial time algorithm for linear programming – N Karmarkar - 1984
1472 Theory of Linear and Integer Programming – A Schrijver - 1986
193 eds, ‘Nonlinear Programming – Mangasarian, K Ritter - 1970
1827 Robust Statistics – P J Huber - 1981
463 Interior-point Methods – Florian A. Potra, Stephen J. Wright - 2000
312 Nonlinear programming: sequential unconstrained minimization techniques,” DTIC Research Report AD0679036 – A V Fiacco, G P McCormick - 1968
1045 Integer and Combinatorial Optimization – G L Nemhauser, L A Wolsey - 1988
1660 Atomic decomposition by basis pursuit – Scott Shaobing Chen, David L. Donoho, Michael, A. Saunders - 1998
284 Theoretical foundations of the potential function method in pattern recognition learning – M Aizerman, E Braverman, L Rozonoer - 1964
1035 Linear and nonlinear programming – D G Luenberger - 1984
2155 Support-Vector Networks – Corinna Cortes, Vladimir Vapnik - 1995
126 Path-following methods for linear programming – C C Gonzaga - 1992
5 Mathematical methods for pattern classification – R C Grinold - 1972
49 Clustering via Concave Minimization – P. S. Bradley, O. L. Mangasarian, W. N. Street - 1997