 | 2011 |
| 36 |  | Zhiwei Qin,
Donald Goldfarb:
Structured Sparsity via Alternating Directions Methods
CoRR abs/1105.0728: (2011) |
| 35 |  | Bo Huang,
Shiqian Ma,
Donald Goldfarb:
Accelerated Linearized Bregman Method
CoRR abs/1106.5413: (2011) |
| 34 |  | Donald Goldfarb,
Shiqian Ma:
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization.
Foundations of Computational Mathematics 11(2): 183-210 (2011) |
| 33 |  | Shiqian Ma,
Donald Goldfarb,
Lifeng Chen:
Fixed point and Bregman iterative methods for matrix rank minimization.
Math. Program. 128(1-2): 321-353 (2011) |
| 32 |  | Lifeng Chen,
Donald Goldfarb:
An interior-point piecewise linear penalty method for nonlinear programming.
Math. Program. 128(1-2): 73-122 (2011) |
| 2010 |
| 31 |  | Katya Scheinberg,
Shiqian Ma,
Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods.
NIPS 2010: 2101-2109 |
| 30 |  | Katya Scheinberg,
Shiqian Ma,
Donald Goldfarb:
Sparse Inverse Covariance Selection via Alternating Linearization Methods
CoRR abs/1011.0097: (2010) |
| 29 |  | Zaiwen Wen,
Wotao Yin,
Donald Goldfarb,
Yin Zhang:
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation.
SIAM J. Scientific Computing 32(4): 1832-1857 (2010) |
| 2009 |
| 28 |  | Shiqian Ma,
Donald Goldfarb,
Lifeng Chen:
Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization
CoRR abs/0905.1643: (2009) |
| 27 |  | Donald Goldfarb,
Shiqian Ma:
Convergence of fixed point continuation algorithms for matrix rank minimization
CoRR abs/0906.3499: (2009) |
| 26 |  | Donald Goldfarb,
Zaiwen Wen,
Wotao Yin:
A Curvilinear Search Method for p-Harmonic Flows on Spheres.
SIAM J. Imaging Sciences 2(1): 84-109 (2009) |
| 25 |  | Donald Goldfarb,
Wotao Yin:
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization.
SIAM J. Scientific Computing 31(5): 3712-3743 (2009) |
| 24 |  | Zaiwen Wen,
Donald Goldfarb:
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization.
SIAM Journal on Optimization 20(3): 1478-1503 (2009) |
| 2008 |
| 23 |  | Wotao Yin,
Stanley Osher,
Donald Goldfarb,
Jérôme Darbon:
Bregman Iterative Algorithms for \ell1-Minimization with Applications to Compressed Sensing.
SIAM J. Imaging Sciences 1(1): 143-168 (2008) |
| 2007 |
| 22 |  | Wotao Yin,
Donald Goldfarb,
Stanley Osher:
A comparison of three total variation based texture extraction models.
J. Visual Communication and Image Representation 18(3): 240-252 (2007) |
| 2006 |
| 21 |  | L. Chen,
Donald Goldfarb:
Interior-point l2-penalty methods for nonlinear programming with strong global convergence properties.
Math. Program. 108(1): 1-36 (2006) |
| 2005 |
| 20 |  | Wotao Yin,
Donald Goldfarb,
Stanley Osher:
Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional.
VLSM 2005: 73-84 |
| 19 |  | Donald Goldfarb,
Katya Scheinberg:
Product-form Cholesky factorization in interior point methods for second-order cone programming.
Math. Program. 103(1): 153-179 (2005) |
| 18 |  | Donald Goldfarb,
Wotao Yin:
Second-order Cone Programming Methods for Total Variation-Based Image Restoration.
SIAM J. Scientific Computing 27(2): 622-645 (2005) |
| 2004 |
| 17 |  | 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 |
| 16 |  | Donald Goldfarb,
Garud Iyengar:
Robust Portfolio Selection Problems.
Math. Oper. Res. 28(1): 1-38 (2003) |
| 15 |  | Farid Alizadeh,
Donald Goldfarb:
Second-order cone programming.
Math. Program. 95(1): 3-51 (2003) |
| 14 |  | Donald Goldfarb,
Garud Iyengar:
Robust convex quadratically constrained programs.
Math. Program. 97(3): 495-515 (2003) |
| 2002 |
| 13 |  | Donald Goldfarb,
Yiqing Lin:
Combinatorial interior point methods for generalized network flow problems.
Math. Program. 93(2): 227-246 (2002) |
| 1999 |
| 12 |  | Donald Goldfarb,
Zhiying Jin:
A new scaling algorithm for the minimum cost network flow problem.
Oper. Res. Lett. 25(5): 205-211 (1999) |
| 1998 |
| 11 |  | 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) |
| 1997 |
| 10 |  | Donald Goldfarb,
Wei Chen:
On strongly polynomial dual simplex algorithms for the maximum flow problem.
Math. Program. 77: 159-168 (1997) |
| 1995 |
| 9 |  | Jonathan Eckstein,
I. Ilkay Boduroglu,
Lazaros C. Polymenakos,
Donald Goldfarb:
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2.
INFORMS Journal on Computing 7(4): 402-416 (1995) |
| 1993 |
| 8 |  | Donald Goldfarb,
Jianxiu Hao:
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.
Discrete Applied Mathematics 47(1): 9-16 (1993) |
| 7 |  | In Chan Choi,
Donald Goldfarb:
Exploiting special structure in a primal-dual path-following algorithm.
Math. Program. 58: 33-52 (1993) |
| 6 |  | Donald Goldfarb,
Shucheng Liu:
An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs.
Math. Program. 61: 161-170 (1993) |
| 1992 |
| 5 |  | Donald Goldfarb,
Jianxiu Hao:
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.
Algorithmica 8(2): 145-160 (1992) |
| 4 |  | John J. Forrest,
Donald Goldfarb:
Steepest-edge simplex algorithms for linear programming.
Math. Program. 57: 341-374 (1992) |
| 1991 |
| 3 |  | Donald Goldfarb,
Shucheng Liu:
An O(n3L) primal interior point algorithm for convex quadratic programming.
Math. Program. 49: 325-340 (1991) |
| 2 |  | Donald Goldfarb,
Dong Xiao:
A primal projective interior point method for linear programming.
Math. Program. 51: 17-43 (1991) |
| 1990 |
| 1 |  | 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) |