Operations Research Center Working Papers: Recent submissions
Now showing items 187-189 of 372
-
Complexity of convex optimization using geometry-based measures and a reference point
(Massachusetts Institute of Technology, Operations Research Center, 2001)Our concern lies in solving the following convex optimization problem: minimize cx subject to Ax=b, x \in P, where P is a closed convex set. We bound the complexity of computing an almost-optimal solution of this problem ... -
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
(Massachusetts Institute of Technology, Operations Research Center, 1998) -
Condition number complexity of an elementary algorithm for resolving a conic linear system
(Massachusetts Institute of Technology, Operations Research Center, 1997)
