A geometric analysis of Renegar's condition number, and its interplay with conic curvature

• 成果类型: Article
• 署名作者: Belloni, Alexandre; Freund, Robert M.
• 署名单位: Massachusetts Institute of Technology (MIT); Duke University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-007-0203-8
• 发表日期: 2009
• 页码: 95-107
• 关键词: convex-optimization; complexity; sets

摘要

For a conic linear system of the form Ax is an element of K, K a convex cone, several condition measures have been extensively studied in the last dozen years. Among these, Renegar's condition number C(A) is arguably the most prominent for its relation to data perturbation, error bounds, problem geometry, and computational complexity of algorithms. Nonetheless, C(A) is a representation-dependent measure which is usually difficult to interpret and may lead to overly conservative bounds of computational complexity and/or geometric quantities associated with the set of feasible solutions. Herein we show that Renegar's condition number is bounded from above and below by certain purely geometric quantities associated with A and K; furthermore our bounds highlight the role of the singular values of A and their relationship with the condition number. Moreover, by using the notion of conic curvature, we show how Renegar's condition number can be used to provide both lower and upper bounds on the width of the set of feasible solutions. This complements the literature where only lower bounds have heretofore been developed.