default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert J. Vanderbei
Person information
- affiliation: Princeton University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j35]Birgit Rudloff
, Firdevs Ulus, Robert J. Vanderbei:
A parametric simplex algorithm for linear vector optimization problems. Math. Program. 163(1-2): 213-242 (2017)- [j34]Robert J. Vanderbei:
The Falling Slinky. Am. Math. Mon. 124(1): 24-36 (2017) - [c1]Haotian Pang, Han Liu, Robert J. Vanderbei, Tuo Zhao:
Parametric Simplex Method for Sparse Learning. NIPS 2017: 188-197 - [i2]Haotian Pang, Tuo Zhao, Robert J. Vanderbei, Han Liu:
Homotopy Parametric Simplex Method for Sparse Learning. CoRR abs/1704.01079 (2017) - 2016
- [j33]Robert J. Vanderbei, Kevin Lin, Han Liu, Lie Wang:
Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods. Math. Program. Comput. 8(3): 253-269 (2016) - 2015
- [j32]Colin Mallows, Robert J. Vanderbei:
Which Young Tableaux Can Represent an Outer Sum? J. Integer Seq. 18(9): 15.9.1 (2015) - 2014
- [j31]Haotian Pang, Han Liu, Robert J. Vanderbei:
The fastclime package for linear programming and large-scale precision matrix estimation in R. J. Mach. Learn. Res. 15(1): 489-493 (2014) - [j30]Robert J. Vanderbei, Gordon Scharf, Daniel Marlow:
A Regression Approach to Fairer Grading. SIAM Rev. 56(2): 337-352 (2014) - 2013
- [i1]Robert J. Vanderbei, Han Liu, Lie Wang, Kevin Lin:
Optimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification. CoRR abs/1312.4426 (2013) - 2012
- [j29]Robert J. Vanderbei:
Fast Fourier optimization. Math. Program. Comput. 4(1): 53-69 (2012) - [j28]Robert J. Vanderbei:
Local Warming. SIAM Rev. 54(3): 597-606 (2012)
2000 – 2009
- 2009
- [j27]Robert J. Vanderbei, Mustafa Ç. Pinar:
Pricing American Perpetual Warrants by Linear Programming. SIAM Rev. 51(4): 767-782 (2009) - [p1]Jeffrey C. Lagarias, Eric M. Rains, Robert J. Vanderbei:
The Kruskal Count. The Mathematics of Preference, Choice and Order 2009: 371-391 - 2008
- [j26]Igor Griva, David F. Shanno, Robert J. Vanderbei, Hande Y. Benson:
Global convergence of a primal-dual interior-point method for nonlinear programming. Algorithmic Oper. Res. 3(1) (2008) - [j25]Robert J. Vanderbei:
Extreme optics and the search for Earth-like planets. Math. Program. 112(1): 255-272 (2008) - 2006
- [j24]Hande Y. Benson, Arun Sen, David F. Shanno, Robert J. Vanderbei:
Interior-Point Algorithms, Penalty Methods and Equilibrium Problems. Comput. Optim. Appl. 34(2): 155-182 (2006) - 2004
- [j23]Hande Y. Benson, David F. Shanno, Robert J. Vanderbei:
Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing. Math. Program. 99(1): 35-48 (2004) - 2003
- [j22]Hande Y. Benson, Robert J. Vanderbei:
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. Math. Program. 95(2): 279-302 (2003) - 2002
- [j21]Hande Y. Benson, Robert J. Vanderbei, David F. Shanno:
Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions. Comput. Optim. Appl. 23(2): 257-272 (2002) - 2000
- [j20]David F. Shanno, Robert J. Vanderbei:
Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Program. 87(2): 303-316 (2000)
1990 – 1999
- 1999
- [j19]Robert J. Vanderbei, David F. Shanno:
An Interior-Point Algorithm for Nonconvex Nonlinear Programming. Comput. Optim. Appl. 13(1-3): 231-252 (1999) - [j18]Robert J. Vanderbei:
Extension of Piyavskii's Algorithm to Continuous Global Optimization. J. Glob. Optim. 14(2): 205-216 (1999) - [j17]Masakazu Muramatsu, Robert J. Vanderbei:
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming. Math. Oper. Res. 24(1): 149-175 (1999) - 1998
- [b1]Robert J. Vanderbei:
Linear programming - foundations and extensions. Kluwer international series in operations research and management service 4, Kluwer 1998, ISBN 978-0-7923-9804-2, pp. I-XVIII, 1-418 - [j16]Robert J. Vanderbei:
Linear Programming: Foundations and Extensions. J. Oper. Res. Soc. 49(1): 93-98 (1998) - 1997
- [j15]Peter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei:
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming. Discret. Appl. Math. 75(1): 39-61 (1997) - 1996
- [j14]Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz:
An Interior-Point Method for Semidefinite Programming. SIAM J. Optim. 6(2): 342-361 (1996) - 1995
- [j13]John M. Mulvey, Robert J. Vanderbei, Stavros A. Zenios:
Robust Optimization of Large-Scale Systems. Oper. Res. 43(2): 264-281 (1995) - [j12]Robert J. Vanderbei:
Affine-Scaling Trajectories Associated with a Semi-Infinite Linear Program. Math. Oper. Res. 20(1): 163-174 (1995) - [j11]Robert J. Vanderbei, Bing Yang:
The Simplest Semidefinite Programs are Trivial. Math. Oper. Res. 20(3): 590-596 (1995) - [j10]Robert J. Vanderbei:
Symmetric Quasidefinite Matrices. SIAM J. Optim. 5(1): 100-113 (1995) - 1994
- [j9]Robert J. Vanderbei:
Commentary - Interior-Point Methods: Algorithms and Formulations. INFORMS J. Comput. 6(1): 32-34 (1994) - 1993
- [j8]Robert J. Vanderbei:
ALPO: Another Linear Program Optimizer. INFORMS J. Comput. 5(2): 134-146 (1993) - [j7]Robert J. Vanderbei, Tamra J. Carpenter:
Symmetric indefinite systems for interior point methods. Math. Program. 58: 1-32 (1993) - [j6]Leslie A. Hall, Robert J. Vanderbei:
Two-thirds is sharp for affine scaling. Oper. Res. Lett. 13(4): 197-201 (1993) - 1992
- [j5]John R. Birge, Robert M. Freund, Robert J. Vanderbei:
Prior reduced fill-in in solving equations in interior point algorithms. Oper. Res. Lett. 11(4): 195-198 (1992) - 1991
- [j4]Robert J. Vanderbei:
A brief description of ALPO. Oper. Res. Lett. 10(9): 531-534 (1991)
1980 – 1989
- 1989
- [j3]Robert J. Vanderbei:
Affine-scaling for linear programs with free variables. Math. Program. 43(1-3): 31-44 (1989) - 1986
- [j2]Robert J. Vanderbei, Marc S. Meketon, Barry A. Freedman:
A Modification of Karmarkar's Linear Programming Algorithm. Algorithmica 1(4): 395-407 (1986) - 1980
- [j1]Robert J. Vanderbei:
The Optimal Choice of a Subset of a Population. Math. Oper. Res. 5(4): 481-486 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
