Skip to main content
SpringerLink
Log in

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

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

For a conic linear system of the form Ax ∈K, K a convex cone, several condition measures have been extensively studied in the last dozen years. Among these, Renegar’s condition number \({\mathcal{C}}(A)\) is arguably the most prominent for its relation to data perturbation, error bounds, problem geometry, and computational complexity of algorithms. Nonetheless, \({\mathcal{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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belloni, A., Freund, R.M., Vempala, S.: An efficient re-scaled perceptron algorithm for conic systems. MIT Operations Research Center Working Paper (2006), no. OR-379-06

  2. Bertsekas D. (1999). Nonlinear Programming. Athena Scientific, Nashua

    MATH  Google Scholar 

  3. Freund R.M. and Vera J.R. (1999). Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optimi. 10(1): 155–176

    Article  MATH  MathSciNet  Google Scholar 

  4. Freund R.M. and Vera J.R. (1999). Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system. Math. Program. 86(2): 225–260

    Article  MATH  MathSciNet  Google Scholar 

  5. Freund R.M. (2004). Complexity of convex optimization using geometry-based measures and a reference point. Math. Program. 99: 197–221

    Article  MATH  MathSciNet  Google Scholar 

  6. Levitin E. and Poljak B.J. (1963). Constrained minimization methods. U.S.S.R. Comput. Math. Math. Phys. 6: 787–823

    MathSciNet  Google Scholar 

  7. Poljak B.J. (1966). Existence theorems and convergence of minimizing sequences in extremum problems with restrictions. Soviet Math. 7: 72–75

    MATH  Google Scholar 

  8. Renegar J. (1994). Some perturbation theory for linear programming. Math. Program. 65(1): 73–91

    Article  MathSciNet  Google Scholar 

  9. Renegar J. (1995). Linear programming, complexity theory and elementary functional analysis. Math. Program. 70(3): 279–351

    Article  MathSciNet  Google Scholar 

  10. Vial J.-P. (1982). Strong convexity of sets and functions. J. Math. Econ. 9: 187–205

    Article  MATH  MathSciNet  Google Scholar 

  11. Vial J.-P. (1983). Strong and weak convexity of sets and functions. Math. Oper. Res. 8(2): 231–259

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fuqua School of Business, Duke University, One Towerview Drive, Box 90120, Durham, NC, 27708-0120, USA

    Alexandre Belloni

  2. MIT Sloan School of Management, 50 Memorial Drive, Cambridge, MA, 02142, USA

    Robert M. Freund

Authors
  1. Alexandre Belloni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert M. Freund
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert M. Freund.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belloni, A., Freund, R.M. A geometric analysis of Renegar’s condition number, and its interplay with conic curvature. Math. Program. 119, 95–107 (2009). https://doi.org/10.1007/s10107-007-0203-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0203-8

Mathematics Subject Classification (2000)

Search

Navigation