Robert J. Vanderbei

Robert J. Vanderbei (born 1955) is an American mathematician and Emeritus Professor in the Department of Operations Research and Financial Engineering at Princeton University.

Biography

Robert J. Vanderbei was born in Grand Rapids, MI, in 1955. He received his BS in Chemistry in 1976 and an MS in Operations Research and Statistics in 1978 from Rensselaer Polytechnic Institute and his PhD in Applied Mathematics from Cornell University in 1981. In his thesis,^[1] he developed probabilistic potential theory for random fields consisting of tensor products of Brownian motions. He was postdoctoral research fellow at New York University's Courant Institute of Mathematical Sciences and then at the Mathematics Department at the University of Illinois Urbana-Champaign. In 1984, he left academia and joined Bell Labs, where he served as a team member of AT&T's Advanced Decision Support Systems venture. In 1990, Vanderbei returned to academia to teach at Princeton University. He is currently a Professor in the Department of Operations Research and Financial Engineering (ORFE). In addition to his appointment in ORFE, he also has courtesy appointments in Mathematics, Astrophysics, Computer Science, and Applied Mathematics. He is also a member of the Bendheim Center for Finance.

Research

Mathematical programming

Vanderbei’s arrival at Bell Labs coincided with Narendra Karmarkar’s discovery of a new polynomial-time algorithm for linear programming. In May 1985, he became the first nonmanagement team member of AT&T's Advanced Decision Support Systems venture, where he served as the interface to Karmarkar and as the lead developer of the first release of the linear programming software.

In 1985, Vanderbei, with Bell Labs colleagues Marc Meketon and Barry Freedman, wrote a paper proving convergence of a variant of Karmarkar's algorithm that became known as the Affine-Scaling algorithm.^[2] Eventually it became known that I.I. Dikin, working in Siberia and publishing in Russian, had proved convergence of the same algorithm under weaker nondegeneracy assumptions many years earlier.^[3] Vanderbei, both individually and with Meketon, and Freedman was awarded US Patents for his theoretical and practical work on the affine-scaling algorithm.^[4][5][6] Taken together with the three patents awarded to Karmarkar, this suite of patents represented the first awarded for what was considered pure mathematics. At the time, they generated loud objections^[7] from other researchers in optimization algorithms.

In 1987, Vanderbei left the development team and moved to the Bell Labs' Math Research Center in Murray Hill, NJ. In 1990, he returned to academia to teach at Princeton University. Throughout the 1990s Vanderbei's research governed the development of interior-point solvers. In 1993, Helmberg, Rendl, Vanderbei, and Wolkowicz developed an interior-point algorithm for semidefinite programming.^[8] Vanderbei later developed algorithms for quadratic problems, convex, and finally nonlinear optimization problems.^[9][10]

Vanderbei is the author of a textbook on linear programming^[11] and a software package for nonlinear programming called LOQO.

Purple America

Vanderbei received widespread attention for something that was only intended to be an exercise for the freshman computer programming course. U.S. News & World Report magazine, among other media outlets, reprinted his so-called Purple America map, which he made after the 2000 US Presidential election (and then subsequent national elections) to depict on a county-by-county level how the elections turned out.

Recent research interests

Since 2001, most of Vanderbei's research has been devoted to developing high-contrast imaging systems with the eventual aim of direct imaging of exoplanets. The concepts he has contributed to include shaped-pupil coronagraphs, PIAA-style pupil mapping coronagraphs, and space-based external occulters. Together with J. Richard Gott, Vanderbei is the author of a National Geographic book called Sizing Up The Universe (Book website).

Other interests

Vanderbei also was a serious glider pilot for many years. From 1988 to 1999 he was chief flight instructor for the Central Jersey Soaring Club. In 1999, he retired from soaring and took up the hobby of astrophotography. He regularly posts new astroimages on his astro gallery website.

Awards and honors

He was elected to the 2006 class of Fellows of the Institute for Operations Research and the Management Sciences.^[12] In 2012 he became a fellow of the Society for Industrial and Applied Mathematics for "contributions to technologies for exoplanet searches and to interior-point methods for nonlinear optimization".^[13] In 2014 he became a fellow of the American Mathematical Society, for "contributions to linear programming and nonlinear optimization problems".^[14] In 2017 he was award the Khachiyan Prize by the INFORMS Optimization Society.^[15]

References

This article incorporates material from Robert J. Vanderbei's bio, which is licensed under the Creative Commons Attribution/Share-Alike License.

1. Vanderbei, R.J.: Toward a Stochastic Calculus for Several Markov Processes, PhD. Thesis, Cornell University, May 1981.
2. Vanderbei, R.J.; Meketon, M.S.; Freedman, B.A.: A modification of Karmarkar's linear programming algorithm, Algorithmica, 1:395–407, 1986.
3. Dikin, I.I.: Iterative solution of problems of linear and quadratic programming, Soviet Mathematics - Doklady, 8:674–675, 1967.
4. Vanderbei, R.J.: Methods and Apparatus for Efficient Resource Allocation, U.S. Patent Number 4,744,026. Extension of Karmarkar algorithm to handle linear programming problems with free variables, May 1988.
5. Vanderbei, R.J.: Methods and Apparatus for Efficient Resource Allocation, U.S. Patent Number 4,885,686. Extension of Karmarkar algorithm to handle linear programming problems with dense columns, December 1988.
6. Freedman, B.A.; Meketon, M.S.; Vanderbei, R.J.: Methods and Apparatus for Efficient Resource Allocation, U.S. Patent Number 4,924,386. Extension of Karmarkar algorithm to handle linear programming problems with nonzero lower bounds and finite upper bounds, May 1990.
7. Dantzig, G.B.; Goldfarb, D; Lawler, E; Monma, C; Robinson, S.M.: Report of the Committee on Algorithms and the Law, Optima, 33:1–19, June 1991.
8. Helmberg, C; Rendl, F.; Vanderbei, R.J.; Wolkowicz, H.: An interior point method for semidefinite programming, SIAM Journal on Optimization, 6:342–361, 1996.
9. Vanderbei, R.J.: LOQO: An interior point code for quadratic programming, Optimization Methods and Software, 12:451–484, 1999.
10. Vanderbei, R.J.; Shanno, D.F.: An Interior-Point Algorithm for Nonconvex Nonlinear Programming, Computational Optimization and Applications, 13:231–252, 1999.
11. Vanderbei, R.J.: Linear Programming: Foundations and Extensions, Kluwer Academic Publishers, 3rd edition, 2007.
12. Fellows: Alphabetical List, Institute for Operations Research and the Management Sciences, retrieved 2019-10-09
13. Society for Industrial and Applied Mathematics (SIAM)
14. 2014 Class of the Fellows of the AMS, American Mathematical Society, retrieved 2014-08-12.
15. Robert Vanderbei is selected as the winner of the 2017 INFORMS Optimization Society Khachiyan Prize

• Vanderbei, Robert J. (July 1991). "Splitting dense columns in sparse linear systems". Linear Algebra and Its Applications. 152: 107–117. doi:10.1016/0024-3795(91)90269-3. ISSN 0024-3795.