Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems by Epelman, Marina A., 1973-, Freund, Robert M.

“…This paper studies measures of conditioning for a conic linear system of the form (FPd): Ax = b, x E Cx, whose data is d = (A, b). We present a new measure of conditioning, denoted pd, and we show implications of lid for problem geometry and algorithm complexity, and demonstrate that the value of = id is independent of the specific data representation of (FPd). …”
Get full text

The rising chorus of Chinese exceptionalism by Ho, Benjamin Yze Ern

Get full text
Get full text

Theoretical Efficiency of A Shifted Barrier Function Algorithm for Linear Programming by Freund, Robert M.

“…This paper examines the theoretical efficiency of solving a standard-form linear program by solving a sequence of shifted-barrier problems of the form minimize cTx - n (xj + ehj) j.,1 x s.t. Ax = b , x + e h > , for a given and fixed shift vector h > 0, and for a sequence of values of > 0 that converges to zero. …”
Get full text

Some Characterizations and Properties of the "Distance to Ill-Posedness" and the Condition Measure of a Conic Linear System by Freund, Robert M., Vera, Jorge R.

“…A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and Cy are closed convex cones, and the data for the system is d = (A, b). …”
Get full text