Donald Goldfarb

Last updated

  1. "Donald Goldfarb". Mathematics Genealogy Project. Retrieved October 14, 2025.
  2. American Men and Women of Science, Thomson Gale 2004
  3. 1 2 "Donald Goldfarb". Center for Statistics and Machine Learning, Princeton University . Retrieved October 14, 2025. He is internationally recognized for the development and analysis of efficient and practical algorithms for solving various classes of optimization problems, including the BFGS quasi-Newton method (QN) for unconstrained optimization, steepest-edge simplex algorithms for linear programming, and the Goldfarb-Idnani algorithm for convex quadratic programming...
  4. "Donald Goldfarb". Industrial Engineering and Operations Research (IEOR) Department, Columbia University . Retrieved October 14, 2025.
  5. "Celebrating Don Goldfarb". Columbia University. November 2024. Retrieved October 14, 2025.
  6. Goldfarb, Donald (1970). "A family of variable metric methods derived by variational means". Mathematics of Computation. 24 (109): 23–26. doi: 10.2307/2004873 . JSTOR   2004873.
  7. Forrest, John J.; Goldfarb, Donald (1992). "Steepest-edge simplex algorithms for linear programming". Mathematical Programming. 57 (1–3). Springer-Verlag: 341–374. doi:10.1007/bf01581089. S2CID   25000105.
Donald Goldfarb
Born (1941-11-14) November 14, 1941 (age 83)
New York City
Known forBSGF algorithm
Awards John von Neumann Theory Prize
Academic background
Education Cornell (BChE - 1963)
Columbia (MA - 1965)
Columbia (PhD - 1966)
Thesis A Conjugate Gradient Method for Nonlinear Programming (1966)
Doctoral advisor Leon Lapidus [1]