1.
Fixed point and Bregman iterative methods for matrix rank minimization
by Ma, Shiqian
Mathematical programming, 2009-09-23, 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-03-24, Vol.141 (1-2), p.349-382
3.
An interior-point piecewise linear penalty method for nonlinear programming
by Chen, Lifeng
Mathematical programming, 2009-07-14, Vol.128 (1-2), p.73-122
4.
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1996-08-01, Vol.21 (3), p.529-539
5.
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
by Goldfarb, Donald
Mathematics of operations research, 1997-11-01, Vol.22 (4), p.793-802
6.
An O(nm)-time network simple algorithm for the shortest path problem
by Donald Goldfarb
Operations research, 1999-05-01, Vol.47 (3), p.445
7.
On the Complexity of a Class of Projective Interior Point Methods
by Goldfarb, Donald
Mathematics of operations research, 1995-02-01, Vol.20 (1), p.116-134
