Donald Goldfarb

Donald Goldfarb (born August 14, 1941 in New York City)^[1] is an American mathematician, best known for his works in mathematical optimization and numerical analysis.

Biography[edit]

Goldfarb studied Chemical Engineering at Cornell University, earning a BSChE in 1963. He obtained an M.S. from Princeton University in 1965, and a doctorate in 1966.^[2]

After getting his Ph.D., Goldfarb spent two years as a post-doc at the Courant Institute in New York City.

In 1968, he co-founded the CS Department at the City College of New York, serving 14 years on its faculty. During the 1979-80 academic year, he was a visiting professor in the CS and ORIE Departments at Cornell University. In 1982, Goldfarb joined the IEOR Department at Columbia, serving as Chair from 1984-2002. He also served as Interim Dean of Columbia's School of Engineering and Applied Science during the 1994-95 and 2012-13 academic years and its Executive Vice Dean during the Spring 2012 semester.

He is one of the developers of the Broyden–Fletcher–Goldfarb–Shanno algorithm.^[3] In 1992, he and J. J. Forrest developed the steepest edge simplex method.^[4]

Awards[edit]

Goldfarb is National Academy of Engineering (NAE) member and SIAM Fellow. He was awarded the INFORMS John Von Neumann Theory Prize in 2017, the Khachiyan Prize in 2013, the INFORMS Prize for Research Excellence in the Interface between OR and CS in 1995, and was listed in The Worlds Most Influential Scientific Minds, 2014, as being among the 99 most cited mathematicians between 2002 and 2012. Goldfarb has served as an editor-in-chief of Mathematical Programming, an editor of the SIAM Journal on Numerical Analysis and the SIAM Journal on Optimization, and as an associate editor of Mathematics of Computation, Operations Research and Mathematical Programming Computation.

References[edit]

^ American Men and Women of Science, Thomson Gale 2004
^ "Donakd Gokdfarb fsvulty homepage", Columbia University School of Engineering. Accessed February 16, 2022.
^ 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.
^ 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.