Robert J. Vanderbei - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2017

Parametric Simplex Method for Sparse LearningHaotian Pang, Han Liu, Robert J. Vanderbei, Tuo Zhao. nips 2017: 187-196 [doi]

A parametric simplex algorithm for linear vector optimization problemsBirgit Rudloff, Firdevs Ulus, Robert J. Vanderbei. mp, 163(1-2):213-242, 2017. [doi]

The Falling SlinkyRobert J. Vanderbei. tamm, 124(1):24-36, 2017. [doi]

2016

Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methodsRobert J. Vanderbei, Kevin Lin, Han Liu, Lie Wang. mpc, 8(3):253-269, 2016. [doi]

2015

Which Young Tableaux Can Represent an Outer Sum?Colin Mallows, Robert J. Vanderbei. jintseq, 18(9), 2015. [doi]

2014

The fastclime package for linear programming and large-scale precision matrix estimation in RHaotian Pang, Han Liu, Robert J. Vanderbei. jmlr, 15(1):489-493, 2014. [doi]

A Regression Approach to Fairer GradingRobert J. Vanderbei, Gordon Scharf, Daniel Marlow. siamrev, 56(2):337-352, 2014. [doi]

2012

Local WarmingRobert J. Vanderbei. siamrev, 54(3):597-606, 2012. [doi]

Fast Fourier optimizationRobert J. Vanderbei. mpc, 4(1):53-69, 2012. [doi]

2009

The Kruskal CountJeffrey C. Lagarias, Eric M. Rains, Robert J. Vanderbei. In Steven J. Brams, William V. Gehrlein, Fred S. Roberts, editors, The Mathematics of Preference, Choice and Order. Studies in Choice and Welfare, pages 371-391, Springer, 2009. [doi]

Pricing American Perpetual Warrants by Linear ProgrammingRobert J. Vanderbei, Mustafa Ç. Pinar. siamrev, 51(4):767-782, 2009. [doi]

2008

Global convergence of a primal-dual interior-point method for nonlinear programmingIgor Griva, David F. Shanno, Robert J. Vanderbei, Hande Y. Benson. aor, 3(1), 2008. [doi]

Extreme optics and the search for Earth-like planetsRobert J. Vanderbei. mp, 112(1):255-272, 2008. [doi]

2006

Interior-Point Algorithms, Penalty Methods and Equilibrium ProblemsHande Y. Benson, Arun Sen, David F. Shanno, Robert J. Vanderbei. coap, 34(2):155-182, 2006. [doi]

2004

Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testingHande Y. Benson, David F. Shanno, Robert J. Vanderbei. mp, 99(1):35-48, 2004. [doi]

2003

Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear ProgrammingHande Y. Benson, Robert J. Vanderbei. mp, 95(2):279-302, 2003. [doi]

2002

Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit FunctionsHande Y. Benson, Robert J. Vanderbei, David F. Shanno. coap, 23(2):257-272, 2002. [doi]

2000

Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methodsDavid F. Shanno, Robert J. Vanderbei. mp, 87(2):303-316, 2000. [doi]

1999

Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite ProgrammingMasakazu Muramatsu, Robert J. Vanderbei. mor, 24(1):149-175, 1999. [doi]

An Interior-Point Algorithm for Nonconvex Nonlinear ProgrammingRobert J. Vanderbei, David F. Shanno. coap, 13(1-3):231-252, 1999. [doi]

Extension of Piyavskii's Algorithm to Continuous Global OptimizationRobert J. Vanderbei. jgo, 14(2):205-216, 1999. [doi]

1998

Linear programming - foundations and extensionsRobert J. Vanderbei. Volume 4 of Kluwer international series in operations research and management service, Kluwer, 1998.

Linear Programming: Foundations and ExtensionsRobert J. Vanderbei. jors, 49(1):93-98, 1998. [doi]

1997

The Discrete Radon Transform and Its Approximate Inversion Via Linear ProgrammingPeter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei. DAM, 75(1):39-61, 1997. [doi]

1996

An Interior-Point Method for Semidefinite ProgrammingChristoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz. siamjo, 6(2):342-361, 1996. [doi]

1995

Robust Optimization of Large-Scale SystemsJohn M. Mulvey, Robert J. Vanderbei, Stavros A. Zenios. ior, 43(2):264-281, 1995. [doi]

Symmetric Quasidefinite MatricesRobert J. Vanderbei. siamjo, 5(1):100-113, 1995. [doi]

Affine-Scaling Trajectories Associated with a Semi-Infinite Linear ProgramRobert J. Vanderbei. mor, 20(1):163-174, 1995. [doi]

The Simplest Semidefinite Programs are TrivialRobert J. Vanderbei, Bing Yang. mor, 20(3):590-596, 1995. [doi]

1994

Commentary - Interior-Point Methods: Algorithms and FormulationsRobert J. Vanderbei. informs, 6(1):32-34, 1994. [doi]

1993

Two-thirds is sharp for affine scalingLeslie A. Hall, Robert J. Vanderbei. orl, 13(4):197-201, 1993. [doi]

Symmetric indefinite systems for interior point methodsRobert J. Vanderbei, Tamra J. Carpenter. mp, 58:1-32, 1993.

ALPO: Another Linear Program OptimizerRobert J. Vanderbei. informs, 5(2):134-146, 1993. [doi]

1992

Prior reduced fill-in in solving equations in interior point algorithmsJohn R. Birge, Robert M. Freund, Robert J. Vanderbei. orl, 11(4):195-198, 1992. [doi]

1991

A brief description of ALPORobert J. Vanderbei. orl, 10(9):531-534, 1991. [doi]

1989

Affine-scaling for linear programs with free variablesRobert J. Vanderbei. mp, 43(1-3):31-44, 1989. [doi]

1986

A Modification of Karmarkar s Linear Programming AlgorithmRobert J. Vanderbei, Marc S. Meketon, Barry A. Freedman. algorithmica, 1(4):395-407, 1986.

1980

The Optimal Choice of a Subset of a PopulationRobert J. Vanderbei. mor, 5(4):481-486, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL