1.
Fixed point and Bregman iterative methods for matrix rank minimization
by Ma, Shiqian
Mathematical programming, 2009, Vol.128 (1-2), p.321-353
2.
Fast alternating linearization methods for minimizing the sum of two convex functions
by Goldfarb, Donald
Mathematical programming, 2012, Vol.141 (1-2), p.349-382
3.
An interior-point piecewise linear penalty method for nonlinear programming
by Chen, Lifeng
Mathematical programming, 2009, Vol.128 (1-2), p.73-122
4.
Combinatorial interior point methods for generalized network flow problems
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.93 (2), p.227-246
5.
Robust active portfolio management
by Erdogan, Emre
The journal of computational finance, 2008, Vol.11 (4), p.71-98
6.
A polynomial dual simplex algorithm for the generalized circulation problem
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.91 (2), p.271-288
7.
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
by Goldfarb, Donald
Operations research, 1999, Vol.47 (3), p.445-448
8.
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1996, Vol.21 (3), p.529-539
9.
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1997, Vol.22 (4), p.793-802
11.
Efficient Shortest Path Simplex Algorithms
by Goldfarb, Donald
Operations research, 1990, Vol.38 (4), p.624-628
12.
An O(nm)-time network simple algorithm for the shortest path problem
by Donald Goldfarb
Operations research, 1999, Vol.47 (3), p.445
13.
On the Complexity of a Class of Projective Interior Point Methods
by Goldfarb, Donald
Mathematics of operations research, 1995, Vol.20 (1), p.116-134
14.
Intellectual disability etiologies and associated psychiatric disorders
by Goldfarb, Donald L
Mental health aspects of developmental disabilities., 2007, Vol.10 (1), p.18
15.
Steepest-edge simplex algorithms for linear programming
by FORREST, J. J
Mathematical programming, 1992, Vol.57 (3), p.341-374
16.
A computational comparison of the dinic and network simplex methods for maximum flow
by Goldfarb, Donald
Annals of operations research, 1988, Vol.13 (1), p.81-123
17.
On strongly polynomial dual simplex algorithms for the maximum flow problem
by GOLDFARB, D
Mathematical programming, 1997, Vol.78 (2), p.159-168
18.
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
by GOLDFARB, D
Mathematical programming, 1990, Vol.47 (3), p.353-365
19.
Curvilinear path steplength algorithms for minimization which use directions of negative curvature
by Goldfarb, Donald
Mathematical programming, 1980, Vol.18 (1), p.31-40
20.
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
by Goldfarb, Donald
Mathematical programming, 1990, Vol.47 (1-3), p.353-365
