IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v172y2017i2d10.1007_s10957-016-0989-8.html
   My bibliography  Save this article

On the Central Paths in Symmetric Cone Programming

Author

Listed:
  • Héctor Ramírez

    (Universidad de Chile)

  • David Sossa

    (Universidad Técnica Federico Santa María)

Abstract

This paper is devoted to the study of optimal solutions of symmetric cone programs by means of the asymptotic behavior of central paths with respect to a broad class of barrier functions. This class is, for instance, larger than that typically found in the literature for semidefinite positive programming. In this general framework, we prove the existence and the convergence of primal, dual and primal–dual central paths. We are then able to establish concrete characterizations of the limit points of these central paths for specific subclasses. Indeed, for the class of barrier functions defined at the origin, we prove that the limit point of a primal central path minimizes the corresponding barrier function over the solution set of the studied symmetric cone program. In addition, we show that the limit points of the primal and dual central paths lie in the relative interior of the primal and dual solution sets for the case of the logarithm and modified logarithm barriers.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:172:y:2017:i:2:d:10.1007_s10957-016-0989-8
    DOI: 10.1007/s10957-016-0989-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0989-8
    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-016-0989-8?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. 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.
    2. Ximei Yang & Hongwei Liu & Yinkui Zhang, 2015. "A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 572-587, August.
    3. A. Auslender & R. Cominetti & M. Haddou, 1997. "Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 43-62, February.
    4. Halicka, M. & de Klerk, E. & Roos, C., 2005. "Limiting behavior of the central path in semidefinite optimization," Other publications TiSEM 82985463-0467-4c61-8be1-1, Tilburg University, School of Economics and Management.
    5. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    6. 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.
    7. Jian Zhang & Kecun Zhang, 2011. "Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(1), pages 75-90, February.
    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. 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.
    2. Ximei Yang & Hongwei Liu & Yinkui Zhang, 2015. "A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 572-587, August.
    3. Changhe Liu & Hongwei Liu & Xinze Liu, 2012. "Polynomial Convergence of Second-Order Mehrotra-Type Predictor-Corrector Algorithms over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 949-965, September.
    4. Hongwei Liu & Ximei Yang & Changhe Liu, 2013. "A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 796-815, September.
    5. M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi, 2017. "Two wide neighborhood interior-point methods for symmetric cone optimization," Computational Optimization and Applications, Springer, vol. 68(1), pages 29-55, September.
    6. 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.
    7. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    8. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    9. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    10. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    11. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    12. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    13. Vu, Duc Thach Son & Ben Gharbia, Ibtihel & Haddou, Mounir & Tran, Quang Huy, 2021. "A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1243-1274.
    14. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    15. 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.
    16. Xiao-Kang Wang & Wen-Hui Hou & Chao Song & Min-Hui Deng & Yong-Yi Li & Jian-Qiang Wang, 2021. "BW-MaxEnt: A Novel MCDM Method for Limited Knowledge," Mathematics, MDPI, vol. 9(14), pages 1-17, July.
    17. Alfred Auslender & Miguel A. Goberna & Marco A. López, 2009. "Penalty and Smoothing Methods for Convex Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 303-319, May.
    18. Peng Zhang & Gejun Bao, 2018. "An Incremental Subgradient Method on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 711-727, March.
    19. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
    20. Zsolt Darvay & Petra Renáta Takács, 2018. "Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood," 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. 26(3), pages 551-563, September.

    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:172:y:2017:i:2:d:10.1007_s10957-016-0989-8. 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.