Robert M. Freund Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:192-219 [Journal]
Robert M. Freund Complexity of convex optimization using geometry-based measures and a reference point. [Citation Graph (0, 0)][DBLP] Math. Program., 2004, v:99, n:2, pp:197-221 [Journal]
Robert M. Freund On the behavior of the homogeneous self-dual model for conic convex optimization. [Citation Graph (0, 0)][DBLP] Math. Program., 2006, v:106, n:3, pp:527-545 [Journal]
Robert M. Freund Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. [Citation Graph (0, 0)][DBLP] Math. Program., 1991, v:51, n:, pp:203-222 [Journal]
Robert M. Freund A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". [Citation Graph (0, 0)][DBLP] Math. Program., 1991, v:52, n:, pp:441-466 [Journal]
Robert M. Freund Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem. [Citation Graph (0, 0)][DBLP] Math. Program., 1993, v:58, n:, pp:385-414 [Journal]