Donald Goldfarb

	2009
22		Shiqian Ma, Donald Goldfarb, Lifeng Chen: Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization CoRR abs/0905.1643: (2009)
21		Donald Goldfarb, Shiqian Ma: Convergence of fixed point continuation algorithms for matrix rank minimization CoRR abs/0906.3499: (2009)
	2007
20		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
19		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
18		Wotao Yin, Donald Goldfarb, Stanley Osher: Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional. VLSM 2005: 73-84
17		Donald Goldfarb, K. Scheinberg: Product-form Cholesky factorization in interior point methods for second-order cone programming. Math. Program. 103(1): 153-179 (2005)
16		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
15		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
14		Donald Goldfarb, Garud Iyengar: Robust Portfolio Selection Problems. Math. Oper. Res. 28(1): 1-38 (2003)
13		Farid Alizadeh, Donald Goldfarb: Second-order cone programming. Math. Program. 95(1): 3-51 (2003)
	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, 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)

Coauthor Index

1	Farid Alizadeh	[13]
2	Ronald D. Armstrong	[11]
3	I. Ilkay Boduroglu	[9]
4	L. Chen	[19]
5	Lifeng Chen	[22]
6	Wei Chen	[10] [11]
7	In Chan Choi	[7]
8	Jonathan Eckstein	[9]
9	John J. Forrest	[4]
10	Jianxiu Hao	[1] [5] [8]
11	Garud Iyengar	[14]
12	Zhiying Jin	[11] [12]
13	S. Liu	[3]
14	Shucheng Liu	[6]
15	Shiqian Ma	[21] [22]
16	Stanley Osher	[18] [20]
17	Lazaros Polymenakos (Lazaros C. Polymenakos)	[9]
18	K. Scheinberg	[15] [17]
19	Dong Xiao	[2]
20	Wotao Yin	[16] [18] [20]

Colors in the list of coauthors