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.
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
3.
Combinatorial interior point methods for generalized network flow problems
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.93 (2), p.227-246
4.
A polynomial dual simplex algorithm for the generalized circulation problem
by GOLDFARB, Donald
Mathematical programming, 2002, Vol.91 (2), p.271-288
5.
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
by Goldfarb, Donald
Operations research, 1999-05-01, Vol.47 (3), p.445-448
6.
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
7.
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
8.
Efficient Shortest Path Simplex Algorithms
by Goldfarb, Donald
Operations research, 1990-07-01, Vol.38 (4), p.624-628
9.
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
10.
Steepest-edge simplex algorithms for linear programming
by FORREST, J. J
Mathematical programming, 1992, Vol.57 (3), p.341-374
11.
On strongly polynomial dual simplex algorithms for the maximum flow problem
by GOLDFARB, D
Mathematical programming, 1997, Vol.78 (2), p.159-168
12.
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
13.
Strongly polynomial dual simplex methods for the maximum flow problem
by ARMSTRONG, R. D
Mathematical programming, 1998, Vol.80 (1), p.17-33
14.
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
15.
A primal projective interior point method for linear programming
by GOLDFARB, D
Mathematical programming, 1991, Vol.51 (1), p.17-43
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
Filter electronic articles 17 Hits
Remove Filters
- Subjects
- Applied Sciences (17)
- Operational Research And Scienti... (17)
- Operational Research. Management Science
- more ...