| 2007 |
|---|
| 19 | EE | 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 |
|---|
| 18 | EE | 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 |
|---|
| 17 | EE | Wotao Yin,
Donald Goldfarb,
Stanley Osher:
Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional.
VLSM 2005: 73-84 |
| 16 | EE | Donald Goldfarb,
K. Scheinberg:
Product-form Cholesky factorization in interior point methods for second-order cone programming.
Math. Program. 103(1): 153-179 (2005) |
| 15 | EE | 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 |
|---|
| 14 | EE | Donald Goldfarb,
K. 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 |
|---|
| 13 | EE | Donald Goldfarb,
Garud Iyengar:
Robust Portfolio Selection Problems.
Math. Oper. Res. 28(1): 1-38 (2003) |
| 12 | EE | Farid Alizadeh,
Donald Goldfarb:
Second-order cone programming.
Math. Program. 95(1): 3-51 (2003) |
| 1999 |
|---|
| 11 | EE | Donald Goldfarb,
Zhiying Jin:
A new scaling algorithm for the minimum cost network flow problem.
Oper. Res. Lett. 25(5): 205-211 (1999) |
| 1998 |
|---|
| 10 | | 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 |
|---|
| 9 | | Donald Goldfarb,
Wei Chen:
On strongly polynomial dual simplex algorithms for the maximum flow problem.
Math. Program. 77: 159-168 (1997) |
| 1993 |
|---|
| 8 | EE | 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,
S. 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) |
