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.
Combinatorial interior point methods for generalized network flow problems
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.93 (2), p.227-246
5.
A polynomial dual simplex algorithm for the generalized circulation problem
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.91 (2), p.271-288
6.
Steepest-edge simplex algorithms for linear programming
by FORREST, J. J
Mathematical programming, 1992, Vol.57 (3), p.341-374
7.
On strongly polynomial dual simplex algorithms for the maximum flow problem
by GOLDFARB, D
Mathematical programming, 1997, Vol.78 (2), p.159-168
8.
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
9.
Curvilinear path steplength algorithms for minimization which use directions of negative curvature
by Goldfarb, Donald
Mathematical programming, 1980-12, Vol.18 (1), p.31-40
10.
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-05, Vol.47 (1-3), p.353-365
11.
Strongly polynomial dual simplex methods for the maximum flow problem
by ARMSTRONG, R. D
Mathematical programming, 1998, Vol.80 (1), p.17-33
12.
An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs
by GOLDFARB, D
Mathematical programming, 1993, Vol.61 (2), p.161-170
13.
Exploiting special structure in a primal—dual path-following algorithm
by Choi, In Chan
Mathematical programming, 1993-01, Vol.58 (1-3), p.33-52
14.
A primal projective interior point method for linear programming
by GOLDFARB, D
Mathematical programming, 1991, Vol.51 (1), p.17-43
15.
Matrix factorizations in optimization of nonlinear functions subject to linear constraints — an addendum
by Goldfarb, Donald
Mathematical programming, 1977-12, Vol.12 (1), p.279-280
16.
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
by GOLDFARB, D
Mathematical programming, 1988, Vol.40 (2), p.183-195
17.
A relaxed version of Karmarkar's method
by GOLDFARB, D
Mathematical programming, 1988, Vol.40 (3), p.289-315
18.
Matrix factorizations in optimization of nonlinear functions subject to linear constraints
by Goldfarb, Donald
Mathematical programming, 1976-12, Vol.10 (1), p.1-31
19.
Modifications and implementation of the ellipsoid algorithm for linear programming
by Goldfarb, Donald
Mathematical programming, 1982-12, Vol.23 (1), p.1-19
