Donald Goldfarb

110 papers A* 7A 2Journal 97Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	ASGO: Adaptive Structured Gradient Optimization. CoRR Kang An, Yuxing Liu, Rui Pan, Shiqian Ma, Donald Goldfarb, Tong Zhang
2023	A	`conf`	A Mini-Block Fisher Method for Deep Neural Networks. AISTATS Achraf Bahamou, Donald Goldfarb, Yi Ren
2022	J	`jnl`	A Mini-Block Natural Gradient Method for Deep Neural Networks. CoRR Achraf Bahamou, Donald Goldfarb, Yi Ren
2021	A*	`conf`	Increasing Iterate Averaging for Solving Saddle-Point Problems. AAAI Yuan Gao, Christian Kroer, Donald Goldfarb
2021	J	`jnl`	Kronecker-factored Quasi-Newton Methods for Convolutional Neural Networks. CoRR Yi Ren, Donald Goldfarb
2021	A*	`conf`	Tensor Normal Training for Deep Learning Models. NeurIPS Yi Ren, Donald Goldfarb
2021	J	`jnl`	Tensor Normal Training for Deep Learning Models. CoRR Yi Ren, Donald Goldfarb
2020	J	`jnl`	ADMM for multiaffine constrained optimization. Optim. Methods Softw. Wenbo Gao, Donald Goldfarb, Frank E. Curtis
2020	A*	`conf`	Practical Quasi-Newton Methods for Training Deep Neural Networks. NeurIPS Donald Goldfarb, Yi Ren, Achraf Bahamou
2020	J	`jnl`	Practical Quasi-Newton Methods for Training Deep Neural Networks. CoRR Donald Goldfarb, Yi Ren, Achraf Bahamou
2019	J	`jnl`	A Dynamic Sampling Adaptive-SGD Method for Machine Learning. CoRR Achraf Bahamou, Donald Goldfarb
2019	J	`jnl`	Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks. CoRR Yi Ren, Donald Goldfarb
2019	A*	`conf`	Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models. NeurIPS Yunfei Teng, Wenbo Gao, François Chalus, Anna Choromanska, Donald Goldfarb, Adrian Weller
2019	J	`jnl`	Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models. CoRR Yunfei Teng, Wenbo Gao, François Chalus, Anna Choromanska, Donald Goldfarb, Adrian Weller
2019	J	`jnl`	Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. Optim. Methods Softw. Wenbo Gao, Donald Goldfarb
2018	J	`jnl`	Block BFGS Methods. SIAM J. Optim. Wenbo Gao, Donald Goldfarb
2017	J	`jnl`	Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. CoRR Cun Mu, Daniel J. Hsu, Donald Goldfarb
2017	J	`jnl`	Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. SIAM J. Matrix Anal. Appl. Cun Mu, Daniel J. Hsu, Donald Goldfarb
2017	A	`conf`	Linear Convergence of Stochastic Frank Wolfe Variants. AISTATS Donald Goldfarb, Garud Iyengar, Chaoxu Zhou
2017	A*	`conf`	Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values. ICML Chaoxu Zhou, Wenbo Gao, Donald Goldfarb
2017	J	`jnl`	Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. SIAM J. Optim. Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu
2017	J	`jnl`	Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. CoRR Cun Mu, Daniel J. Hsu, Donald Goldfarb
2017	J	`jnl`	Using negative curvature in solving nonlinear programs. Comput. Optim. Appl. Donald Goldfarb, Cun Mu, John Wright, Chaoxu Zhou
2016	J	`jnl`	Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. SIAM J. Sci. Comput. Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb
2016	A*	`conf`	Stochastic Block BFGS: Squeezing More Curvature out of Data. ICML Robert M. Gower, Donald Goldfarb, Peter Richtárik
2016	J	`jnl`	Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. CoRR Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu
2015	J	`jnl`	An alternating direction method for total variation denoising. Optim. Methods Softw. Zhiwei (Tony) Qin, Donald Goldfarb, Shiqian Ma
2015	J	`jnl`	Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. SIAM J. Matrix Anal. Appl. Cun Mu, Daniel J. Hsu, Donald Goldfarb
2014	J	`jnl`	Efficient algorithms for robust and stable principal component pursuit problems. Comput. Optim. Appl. Necdet Serhat Aybat, Donald Goldfarb, Shiqian Ma
2014	J	`jnl`	Fast First-Order Methods for Composite Convex Optimization with Backtracking. Found. Comput. Math. Katya Scheinberg, Donald Goldfarb, Xi Bai
2014	J	`jnl`	Robust Low-Rank Tensor Recovery: Models and Algorithms. SIAM J. Matrix Anal. Appl. Donald Goldfarb, Zhiwei (Tony) Qin
2014	J	`jnl`	Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. CoRR Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb
2014	A*	`conf`	Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. ICML Cun Mu, Bo Huang, John Wright, Donald Goldfarb
2013	J	`jnl`	Accelerated Linearized Bregman Method. J. Sci. Comput. Bo Huang, Shiqian Ma, Donald Goldfarb
2013	J	`jnl`	Efficient block-coordinate descent algorithms for the Group Lasso. Math. Program. Comput. Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb
2013	J	`jnl`	Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. Donald Goldfarb, Shiqian Ma, Katya Scheinberg
2013	J	`jnl`	Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. CoRR Cun Mu, Bo Huang, John Wright, Donald Goldfarb
2012	J	`jnl`	Fast Multiple-Splitting Algorithms for Convex Optimization. SIAM J. Optim. Donald Goldfarb, Shiqian Ma
2012	J	`jnl`	On the convergence of an active-set method for ℓ Optim. Methods Softw. Zaiwen Wen, Wotao Yin, Hongchao Zhang, Donald Goldfarb
2012	J	`jnl`	Structured Sparsity via Alternating Direction Methods. J. Mach. Learn. Res. Zhiwei (Tony) Qin, Donald Goldfarb
2011	J	`jnl`	Accelerated Linearized Bregman Method CoRR Bo Huang, Shiqian Ma, Donald Goldfarb
2011	J	`jnl`	An interior-point piecewise linear penalty method for nonlinear programming. Math. Program. Lifeng Chen, Donald Goldfarb
2011	J	`jnl`	Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization. Found. Comput. Math. Donald Goldfarb, Shiqian Ma
2011	J	`jnl`	Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. Shiqian Ma, Donald Goldfarb, Lifeng Chen
2011	J	`jnl`	Structured Sparsity via Alternating Directions Methods CoRR Zhiwei (Tony) Qin, Donald Goldfarb
2010	J	`jnl`	A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation. SIAM J. Sci. Comput. Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
2010	J	`jnl`	Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. Zaiwen Wen, Donald Goldfarb, Wotao Yin
2010	J	`jnl`	Sparse Inverse Covariance Selection via Alternating Linearization Methods CoRR Katya Scheinberg, Shiqian Ma, Donald Goldfarb
2010	—	`conf`	Sparse Inverse Covariance Selection via Alternating Linearization Methods. NIPS Katya Scheinberg, Shiqian Ma, Donald Goldfarb
2009	J	`jnl`	A Curvilinear Search Method for p-Harmonic Flows on Spheres. SIAM J. Imaging Sci. Donald Goldfarb, Zaiwen Wen, Wotao Yin
2009	J	`jnl`	A Line Search Multigrid Method for Large-Scale Nonlinear Optimization. SIAM J. Optim. Zaiwen Wen, Donald Goldfarb
2009	J	`jnl`	Convergence of fixed point continuation algorithms for matrix rank minimization CoRR Donald Goldfarb, Shiqian Ma
2009	J	`jnl`	Fast Alternating Linearization Methods for Minimizing the Sum of Two Convex Functions. CoRR Donald Goldfarb, Shiqian Ma, Katya Scheinberg
2009	J	`jnl`	Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization CoRR Shiqian Ma, Donald Goldfarb, Lifeng Chen
2009	J	`jnl`	Parametric Maximum Flow Algorithms for Fast Total Variation Minimization. SIAM J. Sci. Comput. Donald Goldfarb, Wotao Yin
2009	—	`conf`	Solving low-rank matrix completion problems efficiently. Allerton Donald Goldfarb, Shiqian Ma, Zaiwen Wen
2008	J	`jnl`	Bregman Iterative Algorithms for \ell SIAM J. Imaging Sci. Wotao Yin, Stanley J. Osher, Donald Goldfarb, Jérôme Darbon
2007	J	`jnl`	A comparison of three total variation based texture extraction models. J. Vis. Commun. Image Represent. Wotao Yin, Donald Goldfarb, Stanley J. Osher
2007	J	`jnl`	The Total Variation Regularized L Multiscale Model. Simul. Wotao Yin, Donald Goldfarb, Stanley J. Osher
2006	J	`jnl`	Interior-point l Math. Program. Lifeng Chen, Donald Goldfarb
2005	J	`jnl`	An Iterative Regularization Method for Total Variation-Based Image Restoration. Multiscale Model. Simul. Stanley J. Osher, Martin Burger, Donald Goldfarb, Jinjun Xu, Wotao Yin
2005	—	`conf`	Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L VLSM Wotao Yin, Donald Goldfarb, Stanley J. Osher
2005	J	`jnl`	Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. Donald Goldfarb, Katya Scheinberg
2005	J	`jnl`	Second-order Cone Programming Methods for Total Variation-Based Image Restoration. SIAM J. Sci. Comput. Donald Goldfarb, Wotao Yin
2004	J	`jnl`	A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. Math. Program. Donald Goldfarb, Katya Scheinberg
2003	J	`jnl`	Robust Portfolio Selection Problems. Math. Oper. Res. Donald Goldfarb, Garud Iyengar
2003	J	`jnl`	Robust convex quadratically constrained programs. Math. Program. Donald Goldfarb, Garud Iyengar
2003	J	`jnl`	Second-order cone programming. Math. Program. Farid Alizadeh, Donald Goldfarb
2002	J	`jnl`	A polynomial dual simplex algorithm for the generalized circulation problem. Math. Program. Donald Goldfarb, Zhiying Jin, Yiqing Lin
2002	J	`jnl`	Combinatorial interior point methods for generalized network flow problems. Math. Program. Donald Goldfarb, Yiqing Lin
1999	J	`jnl`	A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. Comput. Optim. Appl. Donald Goldfarb, R. Polyak, Katya Scheinberg, I. Yuzefovich
1999	J	`jnl`	A new scaling algorithm for the minimum cost network flow problem. Oper. Res. Lett. Donald Goldfarb, Zhiying Jin
1999	J	`jnl`	An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem. Oper. Res. Donald Goldfarb, Zhiying Jin
1998	J	`jnl`	Interior Point Trajectories in Semidefinite Programming. SIAM J. Optim. Donald Goldfarb, Katya Scheinberg
1998	J	`jnl`	Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin
1997	J	`jnl`	On strongly polynomial dual simplex algorithms for the maximum flow problem. Math. Program. Donald Goldfarb, Wei Chen
1997	J	`jnl`	Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. Math. Oper. Res. Donald Goldfarb, Zhiying Jin, James B. Orlin
1996	J	`jnl`	A Faster Combinatorial Algorithm for the Generalized Circulation Problem. Math. Oper. Res. Donald Goldfarb, Zhiying Jin
1995	J	`jnl`	Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. INFORMS J. Comput. Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb
1995	J	`jnl`	On the Complexity of a Class of Projective Interior Point Methods. Math. Oper. Res. Donald Goldfarb, Dong X. Shaw
1994	J	`jnl`	A Path-Following Projective Interior Point Method for Linear Programming. SIAM J. Optim. Dong X. Shaw, Donald Goldfarb
1993	J	`jnl`	An O(n Math. Program. Donald Goldfarb, Shucheng Liu
1993	J	`jnl`	Exploiting special structure in a primal-dual path-following algorithm. Math. Program. In Chan Choi, Donald Goldfarb
1993	J	`jnl`	On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. Discret. Appl. Math. Donald Goldfarb, Jianxiu Hao
1993	J	`jnl`	Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization. SIAM J. Optim. Donald Goldfarb, Siyun Wang
1992	J	`jnl`	Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. Algorithmica Donald Goldfarb, Jianxiu Hao
1992	J	`jnl`	Steepest-edge simplex algorithms for linear programming. Math. Program. John J. Forrest, Donald Goldfarb
1991	J	`jnl`	A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming. SIAM J. Optim. Donald Goldfarb, Shucheng Liu, Siyun Wang
1991	J	`jnl`	A primal projective interior point method for linear programming. Math. Program. Donald Goldfarb, Dong Xiao
1991	J	`jnl`	An O(n Math. Program. Donald Goldfarb, Shucheng Liu
1991	J	`jnl`	On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. Donald Goldfarb, Jianxiu Hao
1991	J	`jnl`	Shortest path algorithms using dynamic breadth-first search. Networks Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
1990	J	`jnl`	A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n Math. Program. Donald Goldfarb, Jianxiu Hao
1990	J	`jnl`	Anti-stalling pivot rules for the network simplex algorithm. Networks Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
1990	J	`jnl`	Efficient Shortest Path Simplex Algorithms. Oper. Res. Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
1988	J	`jnl`	A relaxed version of Karmarkar's method. Math. Program. Donald Goldfarb, Sanjay Mehrotra
1988	J	`jnl`	Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Math. Program. Donald Goldfarb, Sanjay Mehrotra
1986	J	`jnl`	Efficient dual simplex algorithms for the assignment problem. Math. Program. Donald Goldfarb
1985	J	`jnl`	Efficient dual simplex algorithms for the assignment problem. Math. Program. Donald Goldfarb
1983	J	`jnl`	A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. Donald Goldfarb, Ashok U. Idnani
1982	J	`jnl`	Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Program. Donald Goldfarb, Michael J. Todd
1981	J	`jnl`	Feature Article - The Ellipsoid Method: A Survey. Oper. Res. Robert G. Bland, Donald Goldfarb, Michael J. Todd
1980	J	`jnl`	Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. Donald Goldfarb
1979	J	`jnl`	Worst case behavior of the steepest edge simplex method. Discret. Appl. Math. Donald Goldfarb, William Y. Sit
1977	J	`jnl`	A practicable steepest-edge simplex algorithm. Math. Program. Donald Goldfarb, John K. Reid
1977	J	`jnl`	Generating conjugate directions without line searches using factorized variable metric updating formulas. Math. Program. Donald Goldfarb
1977	J	`jnl`	Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum. Math. Program. Donald Goldfarb
1977	J	`jnl`	On the Bartels - Golub decomposition for linear programming bases. Math. Program. Donald Goldfarb
1976	J	`jnl`	Matrix factorizations in optimization of nonlinear functions subject to linear constraints. Math. Program. Donald Goldfarb
1972	—	`conf`	Variable metric and conjugate direction methods in unconstrained optimization: recent developments. ACM Annual Conference (1) Donald Goldfarb