IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v135y2007i3d10.1007_s10957-007-9270-5.html
   My bibliography  Save this article

Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs

Author

Listed:
  • M. L. Flegel

    (University of Würzburg)

  • C. Kanzow

    (University of Würzburg)

Abstract

Nondegeneracy assumptions are often needed in order to prove the local fast convergence of suitable algorithms as well as in the sensitivity analysis for semidefinite programs. One of the more standard nondegeneracy conditions is the geometric condition used by Alizadeh et al. (Math. Program. 77:111–128, 1997). On the other hand, Kanzow and Nagel (SIAM J. Optim. 15:654–672, 2005) recently introduced an algebraic condition that was used in order to prove, for the first time, the local quadratic convergence of a suitable algorithm for the solution of semidefinite programs without using the strict complementarity assumption. The aim of this paper is to show that these two nondegeneracy conditions are equivalent.

Suggested Citation

  • M. L. Flegel & C. Kanzow, 2007. "Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 381-397, December.
    • Handle: RePEc:spr:joptap:v:135:y:2007:i:3:d:10.1007_s10957-007-9270-5
    DOI: 10.1007/s10957-007-9270-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-007-9270-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-007-9270-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. E. A. Yıldırım, 2003. "An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 649-676, November.
    2. Defeng Sun & Jie Sun, 2002. "Semismooth Matrix-Valued Functions," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 150-169, February.
    3. C. Kanzow & C. Nagel, 2004. "Technical Note: Some Structural Properties of a Newton-Type Method for Semidefinite Programs," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 219-226, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    2. Lingchen Kong & Levent Tunçel & Naihua Xiu, 2011. "Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 364-389, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Defeng Sun & Jie Sun, 2008. "Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 421-445, May.
    2. Yong-Jin Liu & Li Wang, 2016. "Properties associated with the epigraph of the $$l_1$$ l 1 norm function of projection onto the nonnegative orthant," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 205-221, August.
    3. Sangho Kum & Yongdo Lim, 2010. "Penalized complementarity functions on symmetric cones," Journal of Global Optimization, Springer, vol. 46(3), pages 475-485, March.
    4. Y. D. Chen & Y. Gao & Y.-J. Liu, 2010. "An Inexact SQP Newton Method for Convex SC1 Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 33-49, July.
    5. Defeng Sun, 2006. "The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 761-776, November.
    6. J. Sun & L. W. Zhang & Y. Wu, 2006. "Properties of the Augmented Lagrangian in Nonlinear Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 129(3), pages 437-456, June.
    7. Chengjin Li, 2014. "A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 163(2), pages 569-594, November.
    8. Qingna Li & Donghui Li & Houduo Qi, 2010. "Newton’s Method for Computing the Nearest Correlation Matrix with a Simple Upper Bound," Journal of Optimization Theory and Applications, Springer, vol. 147(3), pages 546-568, December.
    9. Jong-Shi Pang & Defeng Sun & Jie Sun, 2003. "Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 39-63, February.
    10. Houduo Qi, 2009. "Local Duality of Nonlinear Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 124-141, February.
    11. Youyicun Lin & Shenglong Hu, 2022. "$${\text {B}}$$ B -Subdifferential of the Projection onto the Generalized Spectraplex," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 702-724, February.
    12. Shenglong Hu & Guoyin Li, 2021. "$${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex," Computational Optimization and Applications, Springer, vol. 80(3), pages 915-941, December.
    13. Maxim Bouev & Ilia Manaev & Aleksei Minabutdinov, 2013. "Finding the Nearest Valid Covariance Matrix: An FX Market Case," EUSP Department of Economics Working Paper Series Ec-07/13, European University at St. Petersburg, Department of Economics.
    14. Lingchen Kong & Levent Tunçel & Naihua Xiu, 2011. "Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 148(2), pages 364-389, February.
    15. Alberto Seeger & David Sossa, 2015. "Complementarity problems with respect to Loewnerian cones," Journal of Global Optimization, Springer, vol. 62(2), pages 299-318, June.
    16. Lim, Sungmook & Lee, Sangwook & Park, Soondal, 2005. "An [epsilon]-sensitivity analysis for semidefinite programming," European Journal of Operational Research, Elsevier, vol. 164(2), pages 417-422, July.
    17. Chungen Shen & Yunlong Wang & Wenjuan Xue & Lei-Hong Zhang, 2021. "An accelerated active-set algorithm for a quadratic semidefinite program with general constraints," Computational Optimization and Applications, Springer, vol. 78(1), pages 1-42, January.
    18. S. H. Kum & Y. D. Lim, 2009. "Coercivity and Strong Semismoothness of the Penalized Fischer-Burmeister Function for the Symmetric Cone Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 377-383, August.
    19. C. Kanzow & C. Nagel, 2004. "Technical Note: Some Structural Properties of a Newton-Type Method for Semidefinite Programs," Journal of Optimization Theory and Applications, Springer, vol. 122(1), pages 219-226, July.
    20. Shujun Bi & Le Han & Shaohua Pan, 2013. "Approximation of rank function and its application to the nearest low-rank correlation matrix," Journal of Global Optimization, Springer, vol. 57(4), pages 1113-1137, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:135:y:2007:i:3:d:10.1007_s10957-007-9270-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.