2026-09-20T08:36:40Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/292612022-01-13T07:54:52Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Robert M. Freund.
Ordóñez, Fernando, 1970-
Sloan School of Management.
Sloan School of Management
2005-10-14T19:30:40Z
2005-10-14T19:30:40Z
2002
2002
http://hdl.handle.net/1721.1/29261
51896548
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.
Includes bibliographical references (p. 213-216).
The modern theory of condition numbers for convex optimization problems was developed for convex problems in conic format: ... The condition number C(d) for (CPd) has been shown in theory to provide upper and/or lower bounds on many behavioral and computational characteristics of (CPd), from sizes of feasible and optimal solutions to the complexity of algorithms for solving (CPd). However, it is not known to what extent these bounds might be reasonably close to their actual measures of interest. One difficulty in testing the practical relevance of such theoretical bounds is that most practical problems are not presented in conic format. While it is usually easy to transform convex optimization problems into conic format, such transformations are not unique and do not maintain the original data, making this strategy somewhat irrelevant for computational testing of the theory. The purpose of this thesis is to overcome the obstacles stated above. We introduce an extension of condition number theory to include convex optimization problems not in conic form, and is thus more amenable to computational evaluation. This extension considers problems of the form: ... where P is a closed convex set, no longer required to be a cone. We extend many results of condition number theory to problems of form (GPd), including bounds on optimal solution sizes, optimal objective function values, interior-point algorithm complexity, etc.
(cont.) We also test the practical relevance of condition number bounds on quantities of interest for linear optimization problems. We use the NETLIB suite of linear optimization problems as a test-bed for condition number computation and analysis. Our computational results indicate that: (i) most of the NETLIB suite problems have infinite condition number (prior to pre-processing heuristics) (ii) there exists a positive linear relationship between the IPM iterations and log C(d) for the post-processed problem instances, which accounts for 42% of the variation in IPM iterations, (iii) condition numbers provide fairly tight upper bounds on the sizes of minimum-norm feasible solutions, and (iv) condition numbers provide fairly poor upper bounds on the sizes of optimal solutions and optimal objective function values.
by Fernando Ordóñez.
Ph.D.
216 p.
6442537 bytes
6442344 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Sloan School of Management.
On the explanatory value of condition numbers for convex optimization : theoretical issues and computational experience
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="39782b39-62c8-4a9a-af74-7b6aa9bf2115">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>On the explanatory value of condition numbers for convex optimization : theoretical issues and computational experience</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2002</PublicationDate>
<Authors>
<Author>
<DisplayName>Ordóñez, Fernando, 1970-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Sloan School of Management.</Keyword>
<Abstract>The modern theory of condition numbers for convex optimization problems was developed for convex problems in conic format: ... The condition number C(d) for (CPd) has been shown in theory to provide upper and/or lower bounds on many behavioral and computational characteristics of (CPd), from sizes of feasible and optimal solutions to the complexity of algorithms for solving (CPd). However, it is not known to what extent these bounds might be reasonably close to their actual measures of interest. One difficulty in testing the practical relevance of such theoretical bounds is that most practical problems are not presented in conic format. While it is usually easy to transform convex optimization problems into conic format, such transformations are not unique and do not maintain the original data, making this strategy somewhat irrelevant for computational testing of the theory. The purpose of this thesis is to overcome the obstacles stated above. We introduce an extension of condition number theory to include convex optimization problems not in conic form, and is thus more amenable to computational evaluation. This extension considers problems of the form: ... where P is a closed convex set, no longer required to be a cone. We extend many results of condition number theory to problems of form (GPd), including bounds on optimal solution sizes, optimal objective function values, interior-point algorithm complexity, etc.</Abstract>
<Abstract>(cont.) We also test the practical relevance of condition number bounds on quantities of interest for linear optimization problems. We use the NETLIB suite of linear optimization problems as a test-bed for condition number computation and analysis. Our computational results indicate that: (i) most of the NETLIB suite problems have infinite condition number (prior to pre-processing heuristics) (ii) there exists a positive linear relationship between the IPM iterations and log C(d) for the post-processed problem instances, which accounts for 42% of the variation in IPM iterations, (iii) condition numbers provide fairly tight upper bounds on the sizes of minimum-norm feasible solutions, and (iv) condition numbers provide fairly poor upper bounds on the sizes of optimal solutions and optimal objective function values.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>