Philip Wolfe (mathematician)
Philip Wolfe | |
---|---|
Born |
San Francisco | August 11, 1927
Alma mater | University of California, Berkeley |
Thesis | I.Games of Infinite Length; II.A Nondegenerate Formulation and Simplex Solution of Linear Programming Problems (1954) |
Doctoral advisor | Ed Barankin |
Philip Starr "Phil" Wolfe (born August 11, 1927) is considered one of the founders of convex optimization theory and mathematical programming. He received his bachelors, masters and Ph.D. degrees from the University of California, Berkeley.[1] In 1954, he was offered an instructorship in Princeton, where he worked on generalizations of linear programming, such as quadratic programming and general non-linear programming, leading to the Frank-Wolfe algorithm[2] in joint work with Marguerite Frank, then a visitor at Princeton. He joined RAND corporation in 1957, where he worked with George Dantzig, resulting in the now well known DantzigโWolfe decomposition method.[3] In 1965, he moved to IBM's Thomas J. Watson Research Center in Yorktown Heights, New York.
He received the John von Neumann Theory Prize in 1992, jointly with Alan Hoffman.
Selected publications
- Dantzig, George B.; Wolfe, Philip (February 1960). "Decomposition Principle for Linear Programs". Operations Research 8 (1): 101โ111. doi:10.1287/opre.8.1.101.
References
- โ Hoffman, A. J. (2011). "Philip Starr Wolfe". Profiles in Operations Research. International Series in Operations Research & Management Science 147. pp. 627โ642. doi:10.1007/978-1-4419-6281-2_34. ISBN 978-1-4419-6280-5.
- โ Frank, Marguerite; Wolfe, Philip (March 1956). "An algorithm for quadratic programming". Naval Research Logistics Quarterly 3 (1โ2): 95โ110. doi:10.1002/nav.3800030109.
- โ Pearce, Jeremy (23 May 2005). "George B. Dantzig Dies at 90; Devised Math Solution to Broad Problems". The New York Times. Retrieved 13 December 2013.
|