Loading AI tools
American mathematician From Wikipedia, the free encyclopedia
Philip Starr "Phil" Wolfe (August 11, 1927 – December 29, 2016) was an American mathematician and one of the founders of convex optimization theory and mathematical programming.
Philip Wolfe | |
---|---|
Born | |
Died | December 29, 2016 89)[1] Ossining, New York, U.S. | (aged
Alma mater | University of California, Berkeley |
Scientific career | |
Thesis | I.Games of Infinite Length; II.A Nondegenerate Formulation and Simplex Solution of Linear Programming Problems (1954) |
Doctoral advisor | Edward William Barankin |
Wolfe received his bachelor's degree, masters, and Ph.D. degrees from the University of California, Berkeley.[2] He and his wife, Hallie, lived in Ossining, New York.[1]
In 1954, he was offered an instructorship at Princeton, where he worked on generalizations of linear programming, such as quadratic programming and general non-linear programming, leading to the Frank–Wolfe algorithm[3] in joint work with Marguerite Frank, then a visitor at Princeton. When Maurice Sion was on sabbatical at the Institute for Advanced Study, Sion and Wolfe published in 1957 an example of a zero-sum game without a minimax value.[4] Wolfe joined RAND corporation in 1957, where he worked with George Dantzig, resulting in the now well known Dantzig–Wolfe decomposition method.[5] 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.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.