| A family of variable-metric methods derived by variational means D Goldfarb Mathematics of computation 24 (109), 23-26, 1970 | 4712 | 1970 |
| An iterative regularization method for total variation-based image restoration S Osher, M Burger, D Goldfarb, J Xu, W Yin Multiscale Modeling & Simulation 4 (2), 460-489, 2005 | 2324 | 2005 |
| Second-order cone programming F Alizadeh, D Goldfarb Mathematical programming 95 (1), 3-51, 2003 | 1987 | 2003 |
| Bregman Iterative Algorithms for -Minimization with Applications to Compressed Sensing W Yin, S Osher, D Goldfarb, J Darbon SIAM Journal on Imaging sciences 1 (1), 143-168, 2008 | 1752 | 2008 |
| A numerically stable dual method for solving strictly convex quadratic programs D Goldfarb, A Idnani Mathematical programming 27 (1), 1-33, 1983 | 1448 | 1983 |
| Robust portfolio selection problems D Goldfarb, G Iyengar Mathematics of operations research 28 (1), 1-38, 2003 | 1258 | 2003 |
| Fixed point and Bregman iterative methods for matrix rank minimization S Ma, D Goldfarb, L Chen Mathematical Programming 128 (1), 321-353, 2011 | 1233 | 2011 |
| The ellipsoid method: A survey RG Bland, D Goldfarb, MJ Todd Operations research 29 (6), 1039-1091, 1981 | 739 | 1981 |
| Alternating direction augmented Lagrangian methods for semidefinite programming Z Wen, D Goldfarb, W Yin Mathematical Programming Computation 2 (3), 203-230, 2010 | 464 | 2010 |
| Robust low-rank tensor recovery: Models and algorithms D Goldfarb, Z Qin SIAM Journal on Matrix Analysis and Applications 35 (1), 225-253, 2014 | 437 | 2014 |
| Square deal: Lower bounds and improved relaxations for tensor recovery C Mu, B Huang, J Wright, D Goldfarb International conference on machine learning, 73-81, 2014 | 369 | 2014 |
| Fast alternating linearization methods for minimizing the sum of two convex functions D Goldfarb, S Ma, K Scheinberg Mathematical Programming 141, 1-34, 2012 | 324 | 2012 |
| Steepest-edge simplex algorithms for linear programming JJ Forrest, D Goldfarb Mathematical programming 57 (1), 341-374, 1992 | 314 | 1992 |
| A practicable steepest-edge simplex algorithm D Goldfarb, JK Reid Mathematical Programming 12, 361-371, 1977 | 302 | 1977 |
| Extension of Davidon’s variable metric method to maximization under linear inequality and equality constraints D Goldfarb SIAM Journal on Applied Mathematics 17 (4), 739-764, 1969 | 301 | 1969 |
| A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation Z Wen, W Yin, D Goldfarb, Y Zhang SIAM Journal on Scientific Computing 32 (4), 1832-1857, 2010 | 291 | 2010 |
| Second-order cone programming methods for total variation-based image restoration D Goldfarb, W Yin SIAM Journal on Scientific Computing 27 (2), 622-645, 2005 | 288 | 2005 |
| Sparse inverse covariance selection via alternating linearization methods K Scheinberg, S Ma, D Goldfarb Advances in neural information processing systems 23, 2010 | 252 | 2010 |
| Efficient block-coordinate descent algorithms for the group lasso Z Qin, K Scheinberg, D Goldfarb Mathematical Programming Computation 5 (2), 143-169, 2013 | 237 | 2013 |
| Chapter II linear programming D Goldfarb, MJ Todd Handbooks in operations research and management science 1, 73-170, 1989 | 230 | 1989 |
Wotao YinDAMO Academy, Alibaba Group USVerified email at alibaba-inc.com
