Computational experience and the explanatory value of condition numbers for linear optimization
Name
OR-361-02-50856028.pdf
Size
1.92 MB
Format
Adobe PDF
Checksum (MD5)
dc0ee9dbcbe1a66d9b247a4b743d815d
Date Issued
2002
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 361-02
Abstract
The goal of this paper is to develop some computational experience and test the practical relevance of the theory of condition numbers C(d) for linear optimization, as applied to problem instances that one might encounter in practice. We used the NETLIB suite of linear optimization problems as a test bed for condition number computation and analysis. Our computational results indicate that 72% of the NETLIB suite problem instances are ill-conditioned. However, after pre-processing heuristics are applied, only 19% of the post-processed problem instances are ill-conditioned, and log C(d) of the finitely-conditioned post-processed problems is fairly nicely distributed. We also show that the number of IPM iterations needed to solve the problems in the NETLIB suite varies roughly linearly (and monotonically) with log C(d) of the post-processed problem instances. Empirical evidence yields a positive linear relationship between IPM iterations and log C(d) for the post-processed problem instances, significant at the 95% confidence level. Furthermore, 42% of the variation in IPM iterations among the NETLIB suite problem instances is accounted for by log C(d) of the problem instances after pre-processing. Keywords: Convex Optimization, Complexity, Interior-Point Method, Barrier Method.
Description
Abstract in HTML and working paper for download in PDF available via World Wide Web at the Social Science Research Network.
Title from cover. "January 2002."
Includes bibliographical references (leaves 32-34).
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Persistent DSpace Link
