Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems
Name
OR-344-00.pdf
Size
2.53 MB
Format
Adobe PDF
Checksum (MD5)
5f71cea1f957aeaa6030db1f7a208558
Author(s)
Epelman, Marina A., 1973-
Freund, Robert M.
Date Issued
June 2000
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 344-00
Abstract
In recent years, new and powerful research into "condition numbers" for convex optimization has been developed, aimed at capturing the intuitive notion of problem behavior. This research has been shown to be important in studying the efficiency of algorithms, including interior-point algorithms, for convex optimization as well as other behavioral characteristics of these problems such as problem geometry, deformation under data perturbation, etc. 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). We then prove certain relations among a variety of condition measures for (FPd), including ld, pad, Xd, and C(d). We discuss some drawbacks of using the condition number C(d) as the sole measure of conditioning of a conic linear system, and we then introduce the notion of a "pre-conditioner" for (FPd) which results in an equivalent formulation (FPj) of (FPd) with a better condition number C(d). We characterize the best such pre-conditioner and provide an algorithm for constructing an equivalent data instance d whose condition number C(d) is within a known factor of the best possible.
Subjects
Complexity of Convex Programming, Conditioning, Pre-conditioners.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
