Variable metric and conjugate direction methods in unconstrained optimization: recent developments. - Donald Goldfarb (ACM Annual Conference (1), 1972)

Matrix factorizations in optimization of nonlinear functions subject to linear constraints. - Donald Goldfarb (Math. Program., 1976)

Generating conjugate directions without line searches using factorized variable metric updating formulas. - Donald Goldfarb (Math. Program., 1977)

On the Bartels - Golub decomposition for linear programming bases. - Donald Goldfarb (Math. Program., 1977)

Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum. - Donald Goldfarb (Math. Program., 1977)

A practicable steepest-edge simplex algorithm. - Donald Goldfarb; John K. Reid (Math. Program., 1977)

Worst case behavior of the steepest edge simplex method. - Donald Goldfarb; William Y. Sit (Discret. Appl. Math., 1979)

Curvilinear path steplength algorithms for minimization which use directions of negative curvature. - Donald Goldfarb (Math. Program., 1980)

Feature Article - The Ellipsoid Method: A Survey. - Robert G. Bland; Donald Goldfarb; Michael J. Todd (Oper. Res., 1981)

Modifications and implementation of the ellipsoid algorithm for linear programming. - Donald Goldfarb; Michael J. Todd (Math. Program., 1982)

A numerically stable dual method for solving strictly convex quadratic programs. - Donald Goldfarb; Ashok U. Idnani (Math. Program., 1983)

Efficient dual simplex algorithms for the assignment problem. - Donald Goldfarb (Math. Program., 1985)

Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. - Donald Goldfarb; Sanjay Mehrotra (Math. Program., 1988)

A relaxed version of Karmarkar's method. - Donald Goldfarb; Sanjay Mehrotra (Math. Program., 1988)

Efficient Shortest Path Simplex Algorithms. - Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai (Oper. Res., 1990)

A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time. - Donald Goldfarb; Jianxiu Hao (Math. Program., 1990)

Anti-stalling pivot rules for the network simplex algorithm. - Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai (Networks, 1990)

An O(n3L) primal interior point algorithm for convex quadratic programming. - Donald Goldfarb; Shucheng Liu (Math. Program., 1991)

A primal projective interior point method for linear programming. - Donald Goldfarb; Dong Xiao (Math. Program., 1991)

Shortest path algorithms using dynamic breadth-first search. - Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai (Networks, 1991)

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. - Donald Goldfarb; Jianxiu Hao (Oper. Res. Lett., 1991)

A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming. - Donald Goldfarb; Shucheng Liu; Siyun Wang (SIAM J. Optim., 1991)

Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. - Donald Goldfarb; Jianxiu Hao (Algorithmica, 1992)

Steepest-edge simplex algorithms for linear programming. - John J. Forrest; Donald Goldfarb (Math. Program., 1992)

On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. - Donald Goldfarb; Jianxiu Hao (Discret. Appl. Math., 1993)

Exploiting special structure in a primal-dual path-following algorithm. - In Chan Choi; Donald Goldfarb (Math. Program., 1993)

An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs. - Donald Goldfarb; Shucheng Liu (Math. Program., 1993)

Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization. - Donald Goldfarb; Siyun Wang (SIAM J. Optim., 1993)

A Path-Following Projective Interior Point Method for Linear Programming. - Dong X. Shaw; Donald Goldfarb (SIAM J. Optim., 1994)

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. - Jonathan Eckstein; I. Ilkay Boduroglu; Lazaros C. Polymenakos; Donald Goldfarb (INFORMS J. Comput., 1995)

On the Complexity of a Class of Projective Interior Point Methods. - Donald Goldfarb; Dong X. Shaw (Math. Oper. Res., 1995)

A Faster Combinatorial Algorithm for the Generalized Circulation Problem. - Donald Goldfarb; Zhiying Jin (Math. Oper. Res., 1996)

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. - Donald Goldfarb; Zhiying Jin; James B. Orlin (Math. Oper. Res., 1997)

On strongly polynomial dual simplex algorithms for the maximum flow problem. - Donald Goldfarb; Wei Chen (Math. Program., 1997)

Strongly polynomial dual simplex methods for the maximum flow problem. - Ronald D. Armstrong; Wei Chen; Donald Goldfarb; Zhiying Jin (Math. Program., 1998)

Interior Point Trajectories in Semidefinite Programming. - Donald Goldfarb; Katya Scheinberg (SIAM J. Optim., 1998)

A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. - Donald Goldfarb; R. Polyak; Katya Scheinberg; I. Yuzefovich (Comput. Optim. Appl., 1999)

An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem. - Donald Goldfarb; Zhiying Jin (Oper. Res., 1999)

A new scaling algorithm for the minimum cost network flow problem. - Donald Goldfarb; Zhiying Jin (Oper. Res. Lett., 1999)

A polynomial dual simplex algorithm for the generalized circulation problem. - Donald Goldfarb; Zhiying Jin; Yiqing Lin (Math. Program., 2002)

Combinatorial interior point methods for generalized network flow problems. - Donald Goldfarb; Yiqing Lin (Math. Program., 2002)

Robust Portfolio Selection Problems. - Donald Goldfarb; Garud Iyengar (Math. Oper. Res., 2003)

Second-order cone programming. - Farid Alizadeh; Donald Goldfarb (Math. Program., 2003)

Robust convex quadratically constrained programs. - Donald Goldfarb; Garud Iyengar (Math. Program., 2003)

A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. - Donald Goldfarb; Katya Scheinberg (Math. Program., 2004)

Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional. - Wotao Yin; Donald Goldfarb; Stanley J. Osher (VLSM, 2005)

An Iterative Regularization Method for Total Variation-Based Image Restoration. - Stanley J. Osher; Martin Burger 001; Donald Goldfarb; Jinjun Xu; Wotao Yin (Multiscale Model. Simul., 2005)

Product-form Cholesky factorization in interior point methods for second-order cone programming. - Donald Goldfarb; Katya Scheinberg (Math. Program., 2005)

Second-order Cone Programming Methods for Total Variation-Based Image Restoration. - Donald Goldfarb; Wotao Yin (SIAM J. Sci. Comput., 2005)

Interior-point l2-penalty methods for nonlinear programming with strong global convergence properties. - Lifeng Chen; Donald Goldfarb (Math. Program., 2006)

A comparison of three total variation based texture extraction models. - Wotao Yin; Donald Goldfarb; Stanley J. Osher (J. Vis. Commun. Image Represent., 2007)

The Total Variation Regularized L1 Model for Multiscale Decomposition. - Wotao Yin; Donald Goldfarb; Stanley J. Osher (Multiscale Model. Simul., 2007)

Bregman Iterative Algorithms for ell1-Minimization with Applications to Compressed Sensing. - Wotao Yin; Stanley J. Osher; Donald Goldfarb; Jérôme Darbon (SIAM J. Imaging Sci., 2008)

Solving low-rank matrix completion problems efficiently. - Donald Goldfarb; Shiqian Ma; Zaiwen Wen (Allerton, 2009)

A Curvilinear Search Method for p-Harmonic Flows on Spheres. - Donald Goldfarb; Zaiwen Wen; Wotao Yin (SIAM J. Imaging Sci., 2009)

A Line Search Multigrid Method for Large-Scale Nonlinear Optimization. - Zaiwen Wen; Donald Goldfarb (SIAM J. Optim., 2009)

Parametric Maximum Flow Algorithms for Fast Total Variation Minimization. - Donald Goldfarb; Wotao Yin (SIAM J. Sci. Comput., 2009)

Sparse Inverse Covariance Selection via Alternating Linearization Methods. - Katya Scheinberg; Shiqian Ma; Donald Goldfarb (NIPS, 2010)

Alternating direction augmented Lagrangian methods for semidefinite programming. - Zaiwen Wen; Donald Goldfarb; Wotao Yin (Math. Program. Comput., 2010)

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation. - Zaiwen Wen; Wotao Yin; Donald Goldfarb; Yin Zhang 010 (SIAM J. Sci. Comput., 2010)

Structured Sparsity via Alternating Directions Methods - Zhiwei (Tony) Qin; Donald Goldfarb (CoRR, 2011)

Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization. - Donald Goldfarb; Shiqian Ma (Found. Comput. Math., 2011)

An interior-point piecewise linear penalty method for nonlinear programming. - Lifeng Chen; Donald Goldfarb (Math. Program., 2011)

Fixed point and Bregman iterative methods for matrix rank minimization. - Shiqian Ma; Donald Goldfarb; Lifeng Chen (Math. Program., 2011)

Structured Sparsity via Alternating Direction Methods. - Zhiwei (Tony) Qin; Donald Goldfarb (J. Mach. Learn. Res., 2012)

On the convergence of an active-set method for ℓ1 minimization. - Zaiwen Wen; Wotao Yin; Hongchao Zhang; Donald Goldfarb (Optim. Methods Softw., 2012)

Fast Multiple-Splitting Algorithms for Convex Optimization. - Donald Goldfarb; Shiqian Ma (SIAM J. Optim., 2012)

Accelerated Linearized Bregman Method. - Bo Huang; Shiqian Ma; Donald Goldfarb (J. Sci. Comput., 2013)

Fast alternating linearization methods for minimizing the sum of two convex functions. - Donald Goldfarb; Shiqian Ma; Katya Scheinberg (Math. Program., 2013)

Efficient block-coordinate descent algorithms for the Group Lasso. - Zhiwei (Tony) Qin; Katya Scheinberg; Donald Goldfarb (Math. Program. Comput., 2013)

Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. - Cun Mu; Bo Huang; John Wright 001; Donald Goldfarb (ICML, 2014)

Efficient algorithms for robust and stable principal component pursuit problems. - Necdet Serhat Aybat; Donald Goldfarb; Shiqian Ma (Comput. Optim. Appl., 2014)

Fast First-Order Methods for Composite Convex Optimization with Backtracking. - Katya Scheinberg; Donald Goldfarb; Xi Bai (Found. Comput. Math., 2014)

Robust Low-Rank Tensor Recovery: Models and Algorithms. - Donald Goldfarb; Zhiwei (Tony) Qin (SIAM J. Matrix Anal. Appl., 2014)

An alternating direction method for total variation denoising. - Zhiwei (Tony) Qin; Donald Goldfarb; Shiqian Ma (Optim. Methods Softw., 2015)

Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. - Cun Mu; Daniel J. Hsu; Donald Goldfarb (SIAM J. Matrix Anal. Appl., 2015)

Stochastic Block BFGS: Squeezing More Curvature out of Data. - Robert M. Gower; Donald Goldfarb; Peter Richtárik (ICML, 2016)

Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. - Cun Mu; Yuqian Zhang; John Wright 001; Donald Goldfarb (SIAM J. Sci. Comput., 2016)

Linear Convergence of Stochastic Frank Wolfe Variants. - Donald Goldfarb; Garud Iyengar; Chaoxu Zhou (AISTATS, 2017)

Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values. - Chaoxu Zhou; Wenbo Gao; Donald Goldfarb (ICML, 2017)

Using negative curvature in solving nonlinear programs. - Donald Goldfarb; Cun Mu; John Wright 001; Chaoxu Zhou (Comput. Optim. Appl., 2017)

Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. - Xiao Wang; Shiqian Ma; Donald Goldfarb; Wei Liu 005 (SIAM J. Optim., 2017)

Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. - Cun Mu; Daniel J. Hsu; Donald Goldfarb (SIAM J. Matrix Anal. Appl., 2017)

Block BFGS Methods. - Wenbo Gao; Donald Goldfarb (SIAM J. Optim., 2018)

Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models. - Yunfei Teng; Wenbo Gao; François Chalus; Anna Choromanska; Donald Goldfarb; Adrian Weller (NeurIPS, 2019)

Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks. - Yi Ren 007; Donald Goldfarb (CoRR, 2019)

A Dynamic Sampling Adaptive-SGD Method for Machine Learning. - Achraf Bahamou; Donald Goldfarb (CoRR, 2019)

Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. - Wenbo Gao; Donald Goldfarb (Optim. Methods Softw., 2019)

Practical Quasi-Newton Methods for Training Deep Neural Networks. - Donald Goldfarb; Yi Ren 007; Achraf Bahamou (NeurIPS, 2020)

ADMM for multiaffine constrained optimization. - Wenbo Gao; Donald Goldfarb; Frank E. Curtis (Optim. Methods Softw., 2020)

Increasing Iterate Averaging for Solving Saddle-Point Problems. - Yuan Gao; Christian Kroer; Donald Goldfarb (AAAI, 2021)

Tensor Normal Training for Deep Learning Models. - Yi Ren 007; Donald Goldfarb (NeurIPS, 2021)

Kronecker-factored Quasi-Newton Methods for Convolutional Neural Networks. - Yi Ren 007; Donald Goldfarb (CoRR, 2021)

A Mini-Block Natural Gradient Method for Deep Neural Networks. - Achraf Bahamou; Donald Goldfarb; Yi Ren 007 (CoRR, 2022)

A Mini-Block Fisher Method for Deep Neural Networks. - Achraf Bahamou; Donald Goldfarb; Yi Ren 007 (AISTATS, 2023)

ASGO: Adaptive Structured Gradient Optimization. - Kang An; Yuxing Liu; Rui Pan 002; Shiqian Ma; Donald Goldfarb; Tong Zhang 001 (CoRR, 2025)