Robert J. Vanderbei

Affiliations:
  • Princeton University, USA


According to our database1, Robert J. Vanderbei authored at least 39 papers between 1980 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
A parametric simplex algorithm for linear vector optimization problems.
Math. Program., 2017

Homotopy Parametric Simplex Method for Sparse Learning.
CoRR, 2017

Parametric Simplex Method for Sparse Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods.
Math. Program. Comput., 2016

2015
Which Young Tableaux Can Represent an Outer Sum?
J. Integer Seq., 2015

2014
A Regression Approach to Fairer Grading.
SIAM Rev., 2014

The fastclime package for linear programming and large-scale precision matrix estimation in R.
J. Mach. Learn. Res., 2014

2013
Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification.
CoRR, 2013

2012
Local Warming.
SIAM Rev., 2012

Fast Fourier optimization.
Math. Program. Comput., 2012

2009
Pricing American Perpetual Warrants by Linear Programming.
SIAM Rev., 2009

The Kruskal Count.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008
Extreme optics and the search for Earth-like planets.
Math. Program., 2008

Global convergence of a primal-dual interior-point method for nonlinear programming.
Algorithmic Oper. Res., 2008

2006
Interior-Point Algorithms, Penalty Methods and Equilibrium Problems.
Comput. Optim. Appl., 2006

2004
Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing.
Math. Program., 2004

2003
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming.
Math. Program., 2003

2002
Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions.
Comput. Optim. Appl., 2002

2000
Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods.
Math. Program., 2000

1999
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming.
Math. Oper. Res., 1999

Extension of Piyavskii's Algorithm to Continuous Global Optimization.
J. Glob. Optim., 1999

An Interior-Point Algorithm for Nonconvex Nonlinear Programming.
Comput. Optim. Appl., 1999

1998
Linear Programming: Foundations and Extensions.
J. Oper. Res. Soc., 1998

Linear programming - foundations and extensions.
Kluwer international series in operations research and management service 4, Kluwer, ISBN: 978-0-7923-9804-2, 1998

1997
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
Discret. Appl. Math., 1997

1996
An Interior-Point Method for Semidefinite Programming.
SIAM J. Optim., 1996

1995
Symmetric Quasidefinite Matrices.
SIAM J. Optim., 1995

The Simplest Semidefinite Programs are Trivial.
Math. Oper. Res., 1995

Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program.
Math. Oper. Res., 1995

Robust Optimization of Large-Scale Systems.
Oper. Res., 1995

1994
Commentary - Interior-Point Methods: Algorithms and Formulations.
INFORMS J. Comput., 1994

1993
Two-thirds is sharp for affine scaling.
Oper. Res. Lett., 1993

Symmetric indefinite systems for interior point methods.
Math. Program., 1993

ALPO: Another Linear Program Optimizer.
INFORMS J. Comput., 1993

1992
Prior reduced fill-in in solving equations in interior point algorithms.
Oper. Res. Lett., 1992

1991
A brief description of ALPO.
Oper. Res. Lett., 1991

1989
Affine-scaling for linear programs with free variables.
Math. Program., 1989

1986
A Modification of Karmarkar's Linear Programming Algorithm.
Algorithmica, 1986

1980
The Optimal Choice of a Subset of a Population.
Math. Oper. Res., 1980


  Loading...