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

Asymptotic Behavior of Helmberg-Kojima-Monteiro (HKM) Paths in Interior-Point Methods for Monotone Semidefinite Linear Complementarity Problems: General Theory

Author

Listed:
  • C. K. Sim

    (National University of Singapore Business School)

  • G. Zhao

    (National University of Singapore)

Abstract

An interior-point method (IPM) defines a search direction at each interior point of the feasible region. These search directions form a direction field, which in turn gives rise to a system of ordinary differential equations (ODEs). Thus, it is natural to define the underlying paths of the IPM as the solutions of the system of ODEs. In Sim and Zhao (Math. Program. Ser. A, [2007], to appear), these off-central paths are shown to be well-defined analytic curves and any of their accumulation points is a solution to the given monotone semidefinite linear complementarity problem (SDLCP). Off-central paths for a simple example are also studied in Sim and Zhao (Math. Program. Ser. A, [2007], to appear) and their asymptotic behavior near the solution of the example is analyzed. In this paper, which is an extension of Sim and Zhao (Math. Program. Ser. A, [2007], to appear), we study the asymptotic behavior of the off-central paths for general SDLCPs using the dual HKM direction. We give a necessary and sufficient condition for when an off-central path is analytic as a function of $\sqrt{\mu}$ at a solution of the SDLCP. Then, we show that, if the given SDLCP has a unique solution, the first derivative of its off-central path, as a function of $\sqrt{\mu}$ , is bounded. We work under the assumption that the given SDLCP satisfies the strict complementarity condition.

Suggested Citation

  • C. K. Sim & G. Zhao, 2008. "Asymptotic Behavior of Helmberg-Kojima-Monteiro (HKM) Paths in Interior-Point Methods for Monotone Semidefinite Linear Complementarity Problems: General Theory," Journal of Optimization Theory and Applications, Springer, vol. 137(1), pages 11-25, April.
    • Handle: RePEc:spr:joptap:v:137:y:2008:i:1:d:10.1007_s10957-007-9280-3
    DOI: 10.1007/s10957-007-9280-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-007-9280-3
    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-9280-3?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. Sanjay Mehrotra, 1993. "Quadratic Convergence in a Primal-Dual Method," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 741-751, August.
    2. Jos F. Sturm, 1999. "Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 72-94, February.
    3. Josef Stoer & Martin Wechs & Shinji Mizuno, 1998. "High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 832-862, November.
    4. Halická, M. & de Klerk, E. & Roos, C., 2002. "On the convergence of the central path in semidefinite optimization," Other publications TiSEM 9ca12b89-1208-46aa-8d70-4, Tilburg University, School of Economics and Management.
    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. Chee-Khian Sim, 2011. "Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 148(1), pages 79-106, January.
    2. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    3. C. K. Sim, 2009. "On the Analyticity of Underlying HKM Paths for Monotone Semidefinite Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 193-215, April.

    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. Chee-Khian Sim, 2011. "Asymptotic Behavior of Underlying NT Paths in Interior Point Methods for Monotone Semidefinite Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 148(1), pages 79-106, January.
    2. C. K. Sim, 2009. "On the Analyticity of Underlying HKM Paths for Monotone Semidefinite Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 193-215, April.
    3. Halicka, Margareta, 2002. "Analyticity of the central path at the boundary point in semidefinite programming," European Journal of Operational Research, Elsevier, vol. 143(2), pages 311-324, December.
    4. J. X. Cruz Neto & O. P. Ferreira & P. R. Oliveira & R. C. M. Silva, 2008. "Central Paths in Semidefinite Programming, Generalized Proximal-Point Method and Cauchy Trajectories in Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 227-242, November.
    5. Héctor Ramírez & David Sossa, 2017. "On the Central Paths in Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 649-668, February.
    6. Filiz Gurtuna & Cosmin Petra & Florian Potra & Olena Shevchenko & Adrian Vancea, 2011. "Corrector-predictor methods for sufficient linear complementarity problems," Computational Optimization and Applications, Springer, vol. 48(3), pages 453-485, April.
    7. Kristijan Cafuta, 2019. "Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 397-413, June.
    8. Levent Tunçel & Henry Wolkowicz, 2012. "Strong duality and minimal representations for cone optimization," Computational Optimization and Applications, Springer, vol. 53(2), pages 619-648, October.
    9. Florian A. Potra, 2016. "Sufficient weighted complementarity problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 467-488, June.
    10. Sabine Burgdorf & Kristijan Cafuta & Igor Klep & Janez Povh, 2013. "Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials," Computational Optimization and Applications, Springer, vol. 55(1), pages 137-153, May.

    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:137:y:2008:i:1:d:10.1007_s10957-007-9280-3. 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.