Skip to main content
SpringerLink
Log in

Unifying Optimal Partition Approach to Sensitivity Analysis in Conic Optimization

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We study convex conic optimization problems in which the right-hand side and the cost vectors vary linearly as functions of a scalar parameter. We present a unifying geometric framework that subsumes the concept of the optimal partition in linear programming (LP) and semidefinite programming (SDP) and extends it to conic optimization. Similar to the optimal partition approach to sensitivity analysis in LP and SDP, the range of perturbations for which the optimal partition remains constant can be computed by solving two conic optimization problems. Under a weaker notion of nondegeneracy, this range is simply given by a minimum ratio test. We discuss briefly the properties of the optimal value function under such perturbations.

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. Nesterov, Yu. E., and Nemirovskii, A. S., Interior-Point Polynomial Methods in Convex Programming, SIAM Publications, Philadelphia, Pennsylvania, 1994.

    Google Scholar 

  2. Golshtein, E. G., Theory of Convex Programming, Translations of Mathematical Monographs, American Mathematical Society, Providence, Rhode Island, Vol. 36, 1972.

    Google Scholar 

  3. Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  4. Rockafellar, R. T., Conjugate Duality and Optimization, Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, 1974.

    Google Scholar 

  5. Bonnans, J. F., and Shapiro, A., Perturbation Analysis of Optimization Problems, Springer, New York, NY, 2000.

    Google Scholar 

  6. Adler, I., and Monteiro, R. D. C., A Geometric View of Parametric Linear Programming, Algorithmica, Vol. 8, pp. 161–176, 1992.

    Google Scholar 

  7. Jansen, B., Roos, K., and Terlaky, T., An Interior-Point Method Approach to Postoptimal and Parametric Analysis in Linear Programming, Proceedings of the Workshop on Interior-Point Methods, Budapest, Hungary, 1993.

  8. Monteiro, R. D. C., and Mehrotra, S., A General Parametric Analysis Approach and Its Implication to Sensitivity Analysis in Interior-Point Methods, Mathematical Programming, Vol. 72, pp. 65–82, 1996.

    Google Scholar 

  9. Greenberg, H. J., Simultaneous Primal-Dual Right-Hand-Side Sensitivity Analysis from a Strictly Complementary Solution of a Linear Program, SIAM Journal on Optimization, Vol. 10, pp. 427–442, 2000.

    Google Scholar 

  10. Berkelaar, A. B., Jansen, B., Roos, K., and Terlaky, T., Sensitivity Analysis in (Degenerate) Quadratic Programming, Technical Report, Delft University of Technology, Delft, Netherlands, 1996.

    Google Scholar 

  11. Goldfarb, D., and Scheinberg, K., On Parametric Semidefinite Programming, Applied Numerical Mathematics: Transactions of IMACS, Vol. 29, pp. 361–377, 1999.

    Google Scholar 

  12. Holder, A. G., Sturm, J. F., and Zhang, S., Marginal and Parametric Analysis of the Central Optimal Solution, Information Systems and Operational Research, Vol. 39, pp. 394–415, 2001.

    Google Scholar 

  13. Sturm, J. F., and Zhang, S., On Sensitivity of Central Solutions in Semidefinite Programming, Mathematical Programming, Vol. 90, pp. 205–227, 2001.

    Google Scholar 

  14. Brondsted, A., An Introduction to Convex Polytopes, Springer Verlag, Berlin, Germany, 1983.

    Google Scholar 

  15. Barker, G. P., The Lattice of Faces of a Finite-Dimensional Cone, Linear Algebra and Its Applications, Vol. 7, pp. 71–82, 1973.

    Google Scholar 

  16. Pataki, G., Geometry of Semidefinite Programming, Edited by H. Wolkowicz, R. Saigal, and L. Vandenberghe, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, Kluwer Academic Publishers, Boston, Massachusetts, 2000.

    Google Scholar 

  17. Shapiro, A., Sensitivity Analysis of Generalized Equations, Journal of Mathematical Sciences, Vol. 115, pp. 2554–2565, 2003.

    Google Scholar 

  18. Parker, G. P., and Carlson, D., Cones of Diagonally Dominant Matrices, Pacific Journal of Mathematics, Vol. 57, pp. 15–32, 1975.

    Google Scholar 

  19. Yildirim, E. A., An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming, Mathematics of Operations Research (to appear).

  20. Goldman, A. J., and Tucker, A. W., Theory of Linear Programming, Linear Equalities and Related Systems, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, pp. 53–97, 1956.

    Google Scholar 

  21. Caron, R. J., Greenberg, H. J., and Holder, A. G., Analytic Centers and Repelling Inequalities, European Journal of Operational Research, Vol. 143, pp. 268–290, 2002.

    Google Scholar 

  22. Alizadeh, F., and Schmieta, S., Optimization with Semidefinite, Quadratic, and Linear Constraints, RUTCOR Research Report RRR 23–97, Rutgers Center for Operations Research, Hill Center for Mathematical Sciences, 1997.

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, New York

    E. A. Yildirim (Assistant Professor)

Authors
  1. E. A. Yildirim
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yildirim, E.A. Unifying Optimal Partition Approach to Sensitivity Analysis in Conic Optimization. Journal of Optimization Theory and Applications 122, 405–423 (2004). https://doi.org/10.1023/B:JOTA.0000042528.76868.22

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOTA.0000042528.76868.22

Search

Navigation