Donald Goldfarb

Publication Activity (10 Years)

Years Active: 1972-2023
Publications (10 Years): 28

Top Venues

CoRR

SIAM J. Matrix Anal. Appl.

ICML

Optim. Methods Softw.

Publications

Achraf Bahamou, Donald Goldfarb, Yi Ren
A Mini-Block Fisher Method for Deep Neural Networks. AISTATS (2023)
Achraf Bahamou, Donald Goldfarb
Layer-wise Adaptive Step-Sizes for Stochastic First-Order Methods for Deep Learning. CoRR (2023)
Achraf Bahamou, Donald Goldfarb, Yi Ren
A Mini-Block Natural Gradient Method for Deep Neural Networks. CoRR (2022)
Yi Ren, Donald Goldfarb
Tensor Normal Training for Deep Learning Models. CoRR (2021)
Yuan Gao, Christian Kroer, Donald Goldfarb
Increasing Iterate Averaging for Solving Saddle-Point Problems. AAAI (2021)
Yi Ren, Donald Goldfarb
Kronecker-factored Quasi-Newton Methods for Convolutional Neural Networks. CoRR (2021)
Yi Ren, Donald Goldfarb
Tensor Normal Training for Deep Learning Models. NeurIPS (2021)
Donald Goldfarb, Yi Ren, Achraf Bahamou
Practical Quasi-Newton Methods for Training Deep Neural Networks. NeurIPS (2020)
Wenbo Gao, Donald Goldfarb, Frank E. Curtis
ADMM for multiaffine constrained optimization. Optim. Methods Softw. 35 (2) (2020)
Donald Goldfarb, Yi Ren, Achraf Bahamou
Practical Quasi-Newton Methods for Training Deep Neural Networks. CoRR (2020)
Yunfei Teng, Wenbo Gao, François Chalus, Anna Choromanska, Donald Goldfarb, Adrian Weller
Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models. NeurIPS (2019)
Yi Ren, Donald Goldfarb
Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks. CoRR (2019)
Yunfei Teng, Wenbo Gao, François Chalus, Anna Choromanska, Donald Goldfarb, Adrian Weller
Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models. CoRR (2019)
Achraf Bahamou, Donald Goldfarb
A Dynamic Sampling Adaptive-SGD Method for Machine Learning. CoRR (2019)
Wenbo Gao, Donald Goldfarb
Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. Optim. Methods Softw. 34 (1) (2019)
Wenbo Gao, Donald Goldfarb
Block BFGS Methods. SIAM J. Optim. 28 (2) (2018)
Cun Mu, Daniel J. Hsu, Donald Goldfarb
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. SIAM J. Matrix Anal. Appl. 38 (4) (2017)
Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. SIAM J. Optim. 27 (2) (2017)
Chaoxu Zhou, Wenbo Gao, Donald Goldfarb
Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values. ICML (2017)
Cun Mu, Daniel J. Hsu, Donald Goldfarb
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. CoRR (2017)
Donald Goldfarb, Cun Mu, John Wright, Chaoxu Zhou
Using negative curvature in solving nonlinear programs. Comput. Optim. Appl. 68 (3) (2017)
Donald Goldfarb, Garud Iyengar, Chaoxu Zhou
Linear Convergence of Stochastic Frank Wolfe Variants. AISTATS (2017)
Cun Mu, Daniel J. Hsu, Donald Goldfarb
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. CoRR (2017)
Robert M. Gower, Donald Goldfarb, Peter Richtárik
Stochastic Block BFGS: Squeezing More Curvature out of Data. ICML (2016)
Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb
Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. SIAM J. Sci. Comput. 38 (5) (2016)
Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. CoRR (2016)
Zhiwei (Tony) Qin, Donald Goldfarb, Shiqian Ma
An alternating direction method for total variation denoising. Optim. Methods Softw. 30 (3) (2015)
Cun Mu, Daniel J. Hsu, Donald Goldfarb
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. SIAM J. Matrix Anal. Appl. 36 (4) (2015)
Necdet Serhat Aybat, Donald Goldfarb, Shiqian Ma
Efficient algorithms for robust and stable principal component pursuit problems. Comput. Optim. Appl. 58 (1) (2014)
Donald Goldfarb, Zhiwei (Tony) Qin
Robust Low-Rank Tensor Recovery: Models and Algorithms. SIAM J. Matrix Anal. Appl. 35 (1) (2014)
Katya Scheinberg, Donald Goldfarb, Xi Bai
Fast First-Order Methods for Composite Convex Optimization with Backtracking. Found. Comput. Math. 14 (3) (2014)
Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb
Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. CoRR (2014)
Cun Mu, Bo Huang, John Wright, Donald Goldfarb
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. ICML (2014)
Bo Huang, Shiqian Ma, Donald Goldfarb
Accelerated Linearized Bregman Method. J. Sci. Comput. 54 (2-3) (2013)
Donald Goldfarb, Shiqian Ma, Katya Scheinberg
Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141 (1-2) (2013)
Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb
Efficient block-coordinate descent algorithms for the Group Lasso. Math. Program. Comput. 5 (2) (2013)
Cun Mu, Bo Huang, John Wright, Donald Goldfarb
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. CoRR (2013)
Donald Goldfarb, Shiqian Ma
Fast Multiple-Splitting Algorithms for Convex Optimization. SIAM J. Optim. 22 (2) (2012)
Zhiwei (Tony) Qin, Donald Goldfarb
Structured Sparsity via Alternating Direction Methods. J. Mach. Learn. Res. 13 (2012)
Zaiwen Wen, Wotao Yin, Hongchao Zhang, Donald Goldfarb
minimization. Optim. Methods Softw. 27 (6) (2012)
Shiqian Ma, Donald Goldfarb, Lifeng Chen
Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128 (1-2) (2011)
Bo Huang, Shiqian Ma, Donald Goldfarb
Accelerated Linearized Bregman Method CoRR (2011)
Donald Goldfarb, Shiqian Ma
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization. Found. Comput. Math. 11 (2) (2011)
Zhiwei (Tony) Qin, Donald Goldfarb
Structured Sparsity via Alternating Directions Methods CoRR (2011)
Lifeng Chen, Donald Goldfarb
An interior-point piecewise linear penalty method for nonlinear programming. Math. Program. 128 (1-2) (2011)
Zaiwen Wen, Donald Goldfarb, Wotao Yin
Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2 (3-4) (2010)
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation. SIAM J. Sci. Comput. 32 (4) (2010)
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
Sparse Inverse Covariance Selection via Alternating Linearization Methods CoRR (2010)
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
Sparse Inverse Covariance Selection via Alternating Linearization Methods. NIPS (2010)
Shiqian Ma, Donald Goldfarb, Lifeng Chen
Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization CoRR (2009)
Donald Goldfarb, Shiqian Ma
Convergence of fixed point continuation algorithms for matrix rank minimization CoRR (2009)
Zaiwen Wen, Donald Goldfarb
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization. SIAM J. Optim. 20 (3) (2009)
Donald Goldfarb, Wotao Yin
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization. SIAM J. Sci. Comput. 31 (5) (2009)
Donald Goldfarb, Zaiwen Wen, Wotao Yin
A Curvilinear Search Method for p-Harmonic Flows on Spheres. SIAM J. Imaging Sci. 2 (1) (2009)
Donald Goldfarb, Shiqian Ma, Zaiwen Wen
Solving low-rank matrix completion problems efficiently. Allerton (2009)
Donald Goldfarb, Shiqian Ma, Katya Scheinberg
Fast Alternating Linearization Methods for Minimizing the Sum of Two Convex Functions. CoRR (2009)
Wotao Yin, Stanley J. Osher, Donald Goldfarb, Jérôme Darbon
-Minimization with Applications to Compressed Sensing. SIAM J. Imaging Sci. 1 (1) (2008)
Wotao Yin, Donald Goldfarb, Stanley J. Osher
A comparison of three total variation based texture extraction models. J. Vis. Commun. Image Represent. 18 (3) (2007)
Wotao Yin, Donald Goldfarb, Stanley J. Osher
Model for Multiscale Decomposition. Multiscale Model. Simul. 6 (1) (2007)
Lifeng Chen, Donald Goldfarb
-penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108 (1) (2006)
Donald Goldfarb, Wotao Yin
Second-order Cone Programming Methods for Total Variation-Based Image Restoration. SIAM J. Sci. Comput. 27 (2) (2005)
Wotao Yin, Donald Goldfarb, Stanley J. Osher
Functional. VLSM (2005)
Donald Goldfarb, Katya Scheinberg
Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. 103 (1) (2005)
Stanley J. Osher, Martin Burger, Donald Goldfarb, Jinjun Xu, Wotao Yin
An Iterative Regularization Method for Total Variation-Based Image Restoration. Multiscale Model. Simul. 4 (2) (2005)
Donald Goldfarb, Katya Scheinberg
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. Math. Program. 99 (1) (2004)
Farid Alizadeh, Donald Goldfarb
Second-order cone programming. Math. Program. 95 (1) (2003)
Donald Goldfarb, Garud Iyengar
Robust convex quadratically constrained programs. Math. Program. 97 (3) (2003)
Donald Goldfarb, Garud Iyengar
Robust Portfolio Selection Problems. Math. Oper. Res. 28 (1) (2003)
Donald Goldfarb, Zhiying Jin, Yiqing Lin
A polynomial dual simplex algorithm for the generalized circulation problem. Math. Program. 91 (2) (2002)
Donald Goldfarb, Yiqing Lin
Combinatorial interior point methods for generalized network flow problems. Math. Program. 93 (2) (2002)
Donald Goldfarb, Zhiying Jin
A new scaling algorithm for the minimum cost network flow problem. Oper. Res. Lett. 25 (5) (1999)
Donald Goldfarb, Zhiying Jin
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem. Oper. Res. 47 (3) (1999)
Donald Goldfarb, R. Polyak, Katya Scheinberg, I. Yuzefovich
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. Comput. Optim. Appl. 14 (1) (1999)
Donald Goldfarb, Katya Scheinberg
Interior Point Trajectories in Semidefinite Programming. SIAM J. Optim. 8 (4) (1998)
Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin
Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. 80 (1998)
Donald Goldfarb, Wei Chen
On strongly polynomial dual simplex algorithms for the maximum flow problem. Math. Program. 77 (1997)
Donald Goldfarb, Zhiying Jin, James B. Orlin
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 22 (4) (1997)
Donald Goldfarb, Zhiying Jin
A Faster Combinatorial Algorithm for the Generalized Circulation Problem. Math. Oper. Res. 21 (3) (1996)
Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. INFORMS J. Comput. 7 (4) (1995)
Donald Goldfarb, Dong X. Shaw
On the Complexity of a Class of Projective Interior Point Methods. Math. Oper. Res. 20 (1) (1995)
Dong X. Shaw, Donald Goldfarb
A Path-Following Projective Interior Point Method for Linear Programming. SIAM J. Optim. 4 (1) (1994)
Donald Goldfarb, Shucheng Liu
L) primal-dual potential reduction algorithm for solving convex quadratic programs. Math. Program. 61 (1993)
Donald Goldfarb, Siyun Wang
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization. SIAM J. Optim. 3 (2) (1993)
Donald Goldfarb, Jianxiu Hao
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. Discret. Appl. Math. 47 (1) (1993)
In Chan Choi, Donald Goldfarb
Exploiting special structure in a primal-dual path-following algorithm. Math. Program. 58 (1993)
Donald Goldfarb, Jianxiu Hao
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. Algorithmica 8 (2) (1992)
John J. Forrest, Donald Goldfarb
Steepest-edge simplex algorithms for linear programming. Math. Program. 57 (1992)
Donald Goldfarb, Shucheng Liu
L) primal interior point algorithm for convex quadratic programming. Math. Program. 49 (1991)
Donald Goldfarb, Dong Xiao
A primal projective interior point method for linear programming. Math. Program. 51 (1991)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Shortest path algorithms using dynamic breadth-first search. Networks 21 (1) (1991)
Donald Goldfarb, Jianxiu Hao
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10 (7) (1991)
Donald Goldfarb, Shucheng Liu, Siyun Wang
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming. SIAM J. Optim. 1 (2) (1991)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Efficient Shortest Path Simplex Algorithms. Oper. Res. 38 (4) (1990)
Donald Goldfarb, Jianxiu Hao
m) Time. Math. Program. 47 (1990)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Anti-stalling pivot rules for the network simplex algorithm. Networks 20 (1) (1990)
Donald Goldfarb, Sanjay Mehrotra
A relaxed version of Karmarkar's method. Math. Program. 40 (1-3) (1988)
Donald Goldfarb, Sanjay Mehrotra
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Math. Program. 40 (1-3) (1988)
Donald Goldfarb
Efficient dual simplex algorithms for the assignment problem. Math. Program. 34 (3) (1986)
Donald Goldfarb
Efficient dual simplex algorithms for the assignment problem. Math. Program. 33 (2) (1985)
Donald Goldfarb, Ashok U. Idnani
A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27 (1) (1983)

Donald Goldfarb.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Donald Goldfarb