IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v143y2002i2p311-324.html
   My bibliography  Save this article

Analyticity of the central path at the boundary point in semidefinite programming

Author

Listed:
  • Halicka, Margareta

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:143:y:2002:i:2:p:311-324
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00276-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. Sturm, Jos F. & Zhang, Shuzhong, 2000. "On weighted centers for semidefinite programming," European Journal of Operational Research, Elsevier, vol. 126(2), pages 391-407, October.
    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. R. D. C. Monteiro & Jong-Shi Pang, 1998. "On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 39-60, February.
    5. R. D. C. Monteiro & T. Tsuchiya, 1996. "Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 21(4), pages 793-814, November.
    6. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    Full references (including those not matched with items on IDEAS)

    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 & 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.
    3. Cosmin G. Petra & Florian A. Potra, 2019. "A homogeneous model for monotone mixed horizontal linear complementarity problems," Computational Optimization and Applications, Springer, vol. 72(1), pages 241-267, January.
    4. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    5. Sturm, Jos F. & Zhang, Shuzhong, 2000. "On weighted centers for semidefinite programming," European Journal of Operational Research, Elsevier, vol. 126(2), pages 391-407, October.
    6. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Other publications TiSEM 9b41ff5e-2808-4d12-a58c-0, Tilburg University, School of Economics and Management.
    7. 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.
    8. E. de Klerk & C. Roos & T. Terlaky, 1998. "Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 51-69, March.
    9. Badenbroek, Riley & Dahl, Joachim, 2020. "An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK," Other publications TiSEM bcf7ef05-e4e6-4ce8-b2e9-6, Tilburg University, School of Economics and Management.
    10. de Klerk, Etienne & Pasechnik, Dmitrii V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," European Journal of Operational Research, Elsevier, vol. 157(1), pages 39-45, August.
    11. Brinkhuis, Jan, 2015. "On the use of coordinate-free matrix calculus," Journal of Multivariate Analysis, Elsevier, vol. 133(C), pages 377-381.
    12. Renato D. C. Monteiro & Paulo R. Zanjácomo, 2000. "General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 381-399, August.
    13. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Other publications TiSEM b25faf5d-0142-4e14-b598-a, Tilburg University, School of Economics and Management.
    14. Petra Renáta Rigó & Zsolt Darvay, 2018. "Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier," Computational Optimization and Applications, Springer, vol. 71(2), pages 483-508, November.
    15. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    16. de Klerk, E. & Pasechnik, D.V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," Other publications TiSEM 90713b98-8cb2-4d0c-981c-8, Tilburg University, School of Economics and Management.
    17. Kirschner, Felix & de Klerk, Etienne, 2023. "A predictor-corrector algorithm for semidefinite programming that uses the factor width cone," Other publications TiSEM 957e76ec-7f75-4e6e-adc4-c, Tilburg University, School of Economics and Management.
    18. Florian A. Potra, 2016. "Sufficient weighted complementarity problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 467-488, June.
    19. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.
    20. Helmberg, C., 2002. "Semidefinite programming," European Journal of Operational Research, Elsevier, vol. 137(3), pages 461-482, March.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:143:y:2002:i:2:p:311-324. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.