Robert J. Vanderbei

Affiliations:

Princeton University, USA

According to our database¹, Robert J. Vanderbei authored at least 40 papers between 1980 and 2017.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2017

The Falling Slinky.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Am. Math. Mon., 2017

A parametric simplex algorithm for linear vector optimization problems.

[BibT_eX]

[DOI]

Birgit Rudloff

Firdevs Ulus

Robert J. Vanderbei

Math. Program., 2017

Homotopy Parametric Simplex Method for Sparse Learning.

[BibT_eX]

[DOI]

CoRR, 2017

Parametric Simplex Method for Sparse Learning.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Math. Program. Comput., 2016

2015

Which Young Tableaux Can Represent an Outer Sum?

[BibT_eX]

[DOI]

Colin Mallows

Robert J. Vanderbei

J. Integer Seq., 2015

2014

A Regression Approach to Fairer Grading.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Gordon Scharf

Daniel Marlow

SIAM Rev., 2014

The fastclime package for linear programming and large-scale precision matrix estimation in R.

[BibT_eX]

[DOI]

Haotian Pang

Han Liu

Robert J. Vanderbei

J. Mach. Learn. Res., 2014

2013

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

[BibT_eX]

[DOI]

CoRR, 2013

2012

Local Warming.

[BibT_eX]

[DOI]

Robert J. Vanderbei

SIAM Rev., 2012

Fast Fourier optimization.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Math. Program. Comput., 2012

2009

Pricing American Perpetual Warrants by Linear Programming.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Mustafa Ç. Pinar

SIAM Rev., 2009

The Kruskal Count.

[BibT_eX]

[DOI]

Jeffrey C. Lagarias

Eric M. Rains

Robert J. Vanderbei

Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008

Extreme optics and the search for Earth-like planets.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Math. Program., 2008

Global convergence of a primal-dual interior-point method for nonlinear programming.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2008

2006

Interior-Point Algorithms, Penalty Methods and Equilibrium Problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2006

2004

Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing.

[BibT_eX]

[DOI]

Hande Y. Benson

David F. Shanno

Robert J. Vanderbei

Math. Program., 2004

2003

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

[BibT_eX]

[DOI]

Hande Y. Benson

Robert J. Vanderbei

Math. Program., 2003

2002

Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions.

[BibT_eX]

[DOI]

Hande Y. Benson

Robert J. Vanderbei

David F. Shanno

Comput. Optim. Appl., 2002

2000

Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods.

[BibT_eX]

[DOI]

David F. Shanno

Robert J. Vanderbei

Math. Program., 2000

1999

Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming.

[BibT_eX]

[DOI]

Masakazu Muramatsu

Robert J. Vanderbei

Math. Oper. Res., 1999

Extension of Piyavskii's Algorithm to Continuous Global Optimization.

[BibT_eX]

[DOI]

Robert J. Vanderbei

J. Glob. Optim., 1999

An Interior-Point Algorithm for Nonconvex Nonlinear Programming.

[BibT_eX]

[DOI]

Robert J. Vanderbei

David F. Shanno

Comput. Optim. Appl., 1999

1998

Linear Programming: Foundations and Extensions.

[BibT_eX]

[DOI]

Robert J. Vanderbei

J. Oper. Res. Soc., 1998

Linear programming - foundations and extensions.

[BibT_eX]

Robert J. Vanderbei

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

An Interior-Point Method for Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 1996

1995

Symmetric Quasidefinite Matrices.

[BibT_eX]

[DOI]

Robert J. Vanderbei

SIAM J. Optim., 1995

The Simplest Semidefinite Programs are Trivial.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Bing Yang

Math. Oper. Res., 1995

Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Math. Oper. Res., 1995

Robust Optimization of Large-Scale Systems.

[BibT_eX]

[DOI]

John M. Mulvey

Robert J. Vanderbei

Stavros A. Zenios

Oper. Res., 1995

1994

Commentary - Interior-Point Methods: Algorithms and Formulations.

[BibT_eX]

[DOI]

Robert J. Vanderbei

INFORMS J. Comput., 1994

1993

Two-thirds is sharp for affine scaling.

[BibT_eX]

[DOI]

Leslie A. Hall

Robert J. Vanderbei

Oper. Res. Lett., 1993

Symmetric indefinite systems for interior point methods.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Tamra J. Carpenter

Math. Program., 1993

ALPO: Another Linear Program Optimizer.

[BibT_eX]

[DOI]

Robert J. Vanderbei

INFORMS J. Comput., 1993

1992

Prior reduced fill-in in solving equations in interior point algorithms.

[BibT_eX]

[DOI]

John R. Birge

Robert M. Freund

Robert J. Vanderbei

Oper. Res. Lett., 1992

1991

A brief description of ALPO.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Oper. Res. Lett., 1991

1989

Affine-scaling for linear programs with free variables.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Math. Program., 1989

1986

A Modification of Karmarkar's Linear Programming Algorithm.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Marc S. Meketon

Barry A. Freedman

Algorithmica, 1986

1980

The Optimal Choice of a Subset of a Population.

[BibT_eX]

[DOI]

Robert J. Vanderbei

Math. Oper. Res., 1980

Robert J. Vanderbei

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...