default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald Goldfarb
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c13]Achraf Bahamou, Donald Goldfarb, Yi Ren:
A Mini-Block Fisher Method for Deep Neural Networks. AISTATS 2023: 9191-9220- 2022
- [i18]Achraf Bahamou, Donald Goldfarb, Yi Ren:
A Mini-Block Natural Gradient Method for Deep Neural Networks. CoRR abs/2202.04124 (2022) - 2021
- [c12]Yuan Gao, Christian Kroer, Donald Goldfarb:
Increasing Iterate Averaging for Solving Saddle-Point Problems. AAAI 2021: 7537-7544 - [c11]Yi Ren, Donald Goldfarb:
Tensor Normal Training for Deep Learning Models. NeurIPS 2021: 26040-26052 - [i17]Yi Ren, Donald Goldfarb:
Kronecker-factored Quasi-Newton Methods for Convolutional Neural Networks. CoRR abs/2102.06737 (2021) - [i16]Yi Ren, Donald Goldfarb:
Tensor Normal Training for Deep Learning Models. CoRR abs/2106.02925 (2021) - 2020
- [j78]Wenbo Gao, Donald Goldfarb, Frank E. Curtis
:
ADMM for multiaffine constrained optimization. Optim. Methods Softw. 35(2): 257-303 (2020) - [c10]Donald Goldfarb, Yi Ren, Achraf Bahamou:
Practical Quasi-Newton Methods for Training Deep Neural Networks. NeurIPS 2020 - [i15]Donald Goldfarb, Yi Ren, Achraf Bahamou:
Practical Quasi-Newton Methods for Training Deep Neural Networks. CoRR abs/2006.08877 (2020)
2010 – 2019
- 2019
- [j77]Wenbo Gao, Donald Goldfarb:
Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. Optim. Methods Softw. 34(1): 194-217 (2019) - [c9]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: 9821-9831 - [i14]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 abs/1905.10395 (2019) - [i13]Yi Ren, Donald Goldfarb:
Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks. CoRR abs/1906.02353 (2019) - [i12]Achraf Bahamou, Donald Goldfarb:
A Dynamic Sampling Adaptive-SGD Method for Machine Learning. CoRR abs/1912.13357 (2019) - 2018
- [j76]Wenbo Gao, Donald Goldfarb:
Block BFGS Methods. SIAM J. Optim. 28(2): 1205-1231 (2018) - 2017
- [j75]Donald Goldfarb, Cun Mu, John Wright, Chaoxu Zhou:
Using negative curvature in solving nonlinear programs. Comput. Optim. Appl. 68(3): 479-502 (2017) - [j74]Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu:
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. SIAM J. Optim. 27(2): 927-956 (2017) - [j73]Cun Mu, Daniel J. Hsu, Donald Goldfarb:
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. SIAM J. Matrix Anal. Appl. 38(4): 1210-1226 (2017) - [c8]Donald Goldfarb, Garud Iyengar, Chaoxu Zhou:
Linear Convergence of Stochastic Frank Wolfe Variants. AISTATS 2017: 1066-1074 - [c7]Chaoxu Zhou, Wenbo Gao, Donald Goldfarb:
Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values. ICML 2017: 4150-4159 - [i11]Cun Mu, Daniel J. Hsu, Donald Goldfarb:
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. CoRR abs/1705.10404 (2017) - [i10]Cun Mu, Daniel J. Hsu, Donald Goldfarb:
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition. CoRR abs/1706.01169 (2017) - 2016
- [j72]Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb:
Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. SIAM J. Sci. Comput. 38(5) (2016) - [c6]Robert M. Gower, Donald Goldfarb, Peter Richtárik:
Stochastic Block BFGS: Squeezing More Curvature out of Data. ICML 2016: 1869-1878 - [i9]Xiao Wang, Shiqian Ma, Donald Goldfarb, Wei Liu:
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. CoRR abs/1607.01231 (2016) - 2015
- [j71]Zhiwei (Tony) Qin, Donald Goldfarb, Shiqian Ma:
An alternating direction method for total variation denoising. Optim. Methods Softw. 30(3): 594-615 (2015) - [j70]Cun Mu, Daniel J. Hsu, Donald Goldfarb:
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors. SIAM J. Matrix Anal. Appl. 36(4): 1638-1659 (2015) - 2014
- [j69]Necdet Serhat Aybat, Donald Goldfarb, Shiqian Ma:
Efficient algorithms for robust and stable principal component pursuit problems. Comput. Optim. Appl. 58(1): 1-29 (2014) - [j68]Katya Scheinberg, Donald Goldfarb, Xi Bai:
Fast First-Order Methods for Composite Convex Optimization with Backtracking. Found. Comput. Math. 14(3): 389-417 (2014) - [j67]Donald Goldfarb, Zhiwei (Tony) Qin:
Robust Low-Rank Tensor Recovery: Models and Algorithms. SIAM J. Matrix Anal. Appl. 35(1): 225-253 (2014) - [c5]Cun Mu, Bo Huang, John Wright, Donald Goldfarb:
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. ICML 2014: 73-81 - [i8]Cun Mu, Yuqian Zhang, John Wright, Donald Goldfarb:
Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods. CoRR abs/1403.7588 (2014) - 2013
- [j66]Bo Huang, Shiqian Ma, Donald Goldfarb:
Accelerated Linearized Bregman Method. J. Sci. Comput. 54(2-3): 428-453 (2013) - [j65]Donald Goldfarb, Shiqian Ma, Katya Scheinberg:
Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141(1-2): 349-382 (2013) - [j64]Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb:
Efficient block-coordinate descent algorithms for the Group Lasso. Math. Program. Comput. 5(2): 143-169 (2013) - [i7]Cun Mu, Bo Huang, John Wright, Donald Goldfarb:
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. CoRR abs/1307.5870 (2013) - 2012
- [j63]Zhiwei (Tony) Qin, Donald Goldfarb:
Structured Sparsity via Alternating Direction Methods. J. Mach. Learn. Res. 13: 1435-1468 (2012) - [j62]Zaiwen Wen, Wotao Yin, Hongchao Zhang, Donald Goldfarb:
On the convergence of an active-set method for ℓ1 minimization. Optim. Methods Softw. 27(6): 1127-1146 (2012) - [j61]Donald Goldfarb, Shiqian Ma:
Fast Multiple-Splitting Algorithms for Convex Optimization. SIAM J. Optim. 22(2): 533-556 (2012) - 2011
- [j60]Donald Goldfarb, Shiqian Ma:
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization. Found. Comput. Math. 11(2): 183-210 (2011) - [j59]Lifeng Chen, Donald Goldfarb:
An interior-point piecewise linear penalty method for nonlinear programming. Math. Program. 128(1-2): 73-122 (2011) - [j58]Shiqian Ma, Donald Goldfarb, Lifeng Chen:
Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. 128(1-2): 321-353 (2011) - [i6]Zhiwei (Tony) Qin, Donald Goldfarb:
Structured Sparsity via Alternating Directions Methods. CoRR abs/1105.0728 (2011) - [i5]Bo Huang, Shiqian Ma, Donald Goldfarb:
Accelerated Linearized Bregman Method. CoRR abs/1106.5413 (2011) - 2010
- [j57]Zaiwen Wen, Donald Goldfarb, Wotao Yin:
Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3-4): 203-230 (2010) - [j56]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): 1832-1857 (2010) - [c4]Katya Scheinberg, Shiqian Ma, Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods. NIPS 2010: 2101-2109 - [i4]Katya Scheinberg, Shiqian Ma, Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods. CoRR abs/1011.0097 (2010)
2000 – 2009
- 2009
- [j55]Donald Goldfarb, Zaiwen Wen, Wotao Yin:
A Curvilinear Search Method for p-Harmonic Flows on Spheres. SIAM J. Imaging Sci. 2(1): 84-109 (2009) - [j54]Zaiwen Wen, Donald Goldfarb:
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization. SIAM J. Optim. 20(3): 1478-1503 (2009) - [j53]Donald Goldfarb, Wotao Yin:
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization. SIAM J. Sci. Comput. 31(5): 3712-3743 (2009) - [c3]Donald Goldfarb, Shiqian Ma, Zaiwen Wen:
Solving low-rank matrix completion problems efficiently. Allerton 2009: 1013-1020 - [i3]Shiqian Ma, Donald Goldfarb, Lifeng Chen:
Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization. CoRR abs/0905.1643 (2009) - [i2]Donald Goldfarb, Shiqian Ma:
Convergence of fixed point continuation algorithms for matrix rank minimization. CoRR abs/0906.3499 (2009) - [i1]Donald Goldfarb, Shiqian Ma, Katya Scheinberg:
Fast Alternating Linearization Methods for Minimizing the Sum of Two Convex Functions. CoRR abs/0912.4571 (2009) - 2008
- [j52]Wotao Yin, Stanley J. Osher, Donald Goldfarb, Jérôme Darbon:
Bregman Iterative Algorithms for \ell1-Minimization with Applications to Compressed Sensing. SIAM J. Imaging Sci. 1(1): 143-168 (2008) - 2007
- [j51]Wotao Yin, Donald Goldfarb, Stanley J. Osher:
A comparison of three total variation based texture extraction models. J. Vis. Commun. Image Represent. 18(3): 240-252 (2007) - [j50]Wotao Yin, Donald Goldfarb, Stanley J. Osher:
The Total Variation Regularized L1 Model for Multiscale Decomposition. Multiscale Model. Simul. 6(1): 190-211 (2007) - 2006
- [j49]Lifeng Chen, Donald Goldfarb:
Interior-point l2-penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108(1): 1-36 (2006) - 2005
- [j48]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): 460-489 (2005) - [j47]Donald Goldfarb, Katya Scheinberg:
Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. 103(1): 153-179 (2005) - [j46]Donald Goldfarb, Wotao Yin:
Second-order Cone Programming Methods for Total Variation-Based Image Restoration. SIAM J. Sci. Comput. 27(2): 622-645 (2005) - [c2]Wotao Yin, Donald Goldfarb, Stanley J. Osher:
Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional. VLSM 2005: 73-84 - 2004
- [j45]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): 1-34 (2004) - 2003
- [j44]Donald Goldfarb, Garud Iyengar:
Robust Portfolio Selection Problems. Math. Oper. Res. 28(1): 1-38 (2003) - [j43]Farid Alizadeh, Donald Goldfarb:
Second-order cone programming. Math. Program. 95(1): 3-51 (2003) - [j42]Donald Goldfarb, Garud Iyengar:
Robust convex quadratically constrained programs. Math. Program. 97(3): 495-515 (2003) - 2002
- [j41]Donald Goldfarb, Zhiying Jin, Yiqing Lin:
A polynomial dual simplex algorithm for the generalized circulation problem. Math. Program. 91(2): 271-288 (2002) - [j40]Donald Goldfarb, Yiqing Lin:
Combinatorial interior point methods for generalized network flow problems. Math. Program. 93(2): 227-246 (2002)
1990 – 1999
- 1999
- [j39]Donald Goldfarb, R. Polyak, Katya Scheinberg, I. Yuzefovich:
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization. Comput. Optim. Appl. 14(1): 55-74 (1999) - [j38]Donald Goldfarb, Zhiying Jin:
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem. Oper. Res. 47(3): 445-448 (1999) - [j37]Donald Goldfarb, Zhiying Jin:
A new scaling algorithm for the minimum cost network flow problem. Oper. Res. Lett. 25(5): 205-211 (1999) - 1998
- [j36]Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin:
Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. 80: 17-33 (1998) - [j35]Donald Goldfarb, Katya Scheinberg:
Interior Point Trajectories in Semidefinite Programming. SIAM J. Optim. 8(4): 871-886 (1998) - 1997
- [j34]Donald Goldfarb, Zhiying Jin, James B. Orlin:
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 22(4): 793-802 (1997) - [j33]Donald Goldfarb, Wei Chen:
On strongly polynomial dual simplex algorithms for the maximum flow problem. Math. Program. 77: 159-168 (1997) - 1996
- [j32]Donald Goldfarb, Zhiying Jin:
A Faster Combinatorial Algorithm for the Generalized Circulation Problem. Math. Oper. Res. 21(3): 529-539 (1996) - 1995
- [j31]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): 402-416 (1995) - [j30]Donald Goldfarb, Dong X. Shaw:
On the Complexity of a Class of Projective Interior Point Methods. Math. Oper. Res. 20(1): 116-134 (1995) - 1994
- [j29]Dong X. Shaw, Donald Goldfarb:
A Path-Following Projective Interior Point Method for Linear Programming. SIAM J. Optim. 4(1): 65-85 (1994) - 1993
- [j28]Donald Goldfarb, Jianxiu Hao:
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. Discret. Appl. Math. 47(1): 9-16 (1993) - [j27]In Chan Choi, Donald Goldfarb:
Exploiting special structure in a primal-dual path-following algorithm. Math. Program. 58: 33-52 (1993) - [j26]Donald Goldfarb, Shucheng Liu:
An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs. Math. Program. 61: 161-170 (1993) - [j25]Donald Goldfarb, Siyun Wang:
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization. SIAM J. Optim. 3(2): 382-397 (1993) - 1992
- [j24]Donald Goldfarb, Jianxiu Hao:
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. Algorithmica 8(2): 145-160 (1992) - [j23]John J. Forrest, Donald Goldfarb:
Steepest-edge simplex algorithms for linear programming. Math. Program. 57: 341-374 (1992) - 1991
- [j22]Donald Goldfarb, Shucheng Liu:
An O(n3L) primal interior point algorithm for convex quadratic programming. Math. Program. 49: 325-340 (1991) - [j21]Donald Goldfarb, Dong Xiao:
A primal projective interior point method for linear programming. Math. Program. 51: 17-43 (1991) - [j20]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Shortest path algorithms using dynamic breadth-first search. Networks 21(1): 29-50 (1991) - [j19]Donald Goldfarb, Jianxiu Hao:
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10(7): 383-387 (1991) - [j18]Donald Goldfarb, Shucheng Liu, Siyun Wang:
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming. SIAM J. Optim. 1(2): 252-267 (1991) - 1990
- [j17]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Efficient Shortest Path Simplex Algorithms. Oper. Res. 38(4): 624-628 (1990) - [j16]Donald Goldfarb, Jianxiu Hao:
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time. Math. Program. 47: 353-365 (1990) - [j15]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Anti-stalling pivot rules for the network simplex algorithm. Networks 20(1): 79-91 (1990)
1980 – 1989
- 1988
- [j14]Donald Goldfarb, Sanjay Mehrotra:
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value. Math. Program. 40(1-3): 183-195 (1988) - [j13]Donald Goldfarb, Sanjay Mehrotra:
A relaxed version of Karmarkar's method. Math. Program. 40(1-3): 289-315 (1988) - 1986
- [j12]Donald Goldfarb:
Efficient dual simplex algorithms for the assignment problem. Math. Program. 34(3): 372 (1986) - 1985
- [j11]Donald Goldfarb:
Efficient dual simplex algorithms for the assignment problem. Math. Program. 33(2): 187-203 (1985) - 1983
- [j10]Donald Goldfarb, Ashok U. Idnani:
A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27(1): 1-33 (1983) - 1982
- [j9]Donald Goldfarb, Michael J. Todd:
Modifications and implementation of the ellipsoid algorithm for linear programming. Math. Program. 23(1): 1-19 (1982) - 1981
- [j8]Robert G. Bland, Donald Goldfarb, Michael J. Todd:
Feature Article - The Ellipsoid Method: A Survey. Oper. Res. 29(6): 1039-1091 (1981) - 1980
- [j7]Donald Goldfarb:
Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. 18(1): 31-40 (1980)
1970 – 1979
- 1979
- [j6]Donald Goldfarb, William Y. Sit:
Worst case behavior of the steepest edge simplex method. Discret. Appl. Math. 1(4): 277-285 (1979) - 1977
- [j5]Donald Goldfarb:
Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum. Math. Program. 12(1): 279-280 (1977) - [j4]Donald Goldfarb, John K. Reid:
A practicable steepest-edge simplex algorithm. Math. Program. 12(1): 361-371 (1977) - [j3]Donald Goldfarb:
Generating conjugate directions without line searches using factorized variable metric updating formulas. Math. Program. 13(1): 94-110 (1977) - [j2]Donald Goldfarb:
On the Bartels - Golub decomposition for linear programming bases. Math. Program. 13(1): 272-279 (1977) - 1976
- [j1]Donald Goldfarb:
Matrix factorizations in optimization of nonlinear functions subject to linear constraints. Math. Program. 10(1): 1-31 (1976) - 1972
- [c1]Donald Goldfarb:
Variable metric and conjugate direction methods in unconstrained optimization: recent developments. ACM Annual Conference (1) 1972: 496-506
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
