IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v139y2008i2d10.1007_s10957-008-9422-2.html
   My bibliography  Save this article

Central Paths in Semidefinite Programming, Generalized Proximal-Point Method and Cauchy Trajectories in Riemannian Manifolds

Author

Listed:
  • J. X. Cruz Neto

    (Universidade Federal do Piauí)

  • O. P. Ferreira

    (Universidade Federal de Goiás)

  • P. R. Oliveira

    (Universidade Federal do Rio de Janeiro)

  • R. C. M. Silva

    (Universidade Federal de Amazonas)

Abstract

The relationships among the central path in the context of semidefinite programming, generalized proximal-point method and Cauchy trajectory in a Riemannian manifolds is studied in this paper. First, it is proved that the central path associated to a general function is well defined. The convergence and characterization of its limit point is established for functions satisfying a certain continuity property. Also, the generalized proximal-point method is considered and it is proved that the correspondingly generated sequence is contained in the central path. As a consequence, both converge to the same point. Finally, it is proved that the central path coincides with the Cauchy trajectory in a Riemannian manifold.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:joptap:v:139:y:2008:i:2:d:10.1007_s10957-008-9422-2
    DOI: 10.1007/s10957-008-9422-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9422-2
    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-008-9422-2?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. 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.
    2. NESTEROV , Yu. & TODD, Mike, 2002. "On the Riemannian geometry defined by self-concordant barriers and interior-point methods," LIDAM Reprints CORE 1595, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. A. N. Iusem, 1998. "On Some Properties of Generalized Proximal Point Methods for Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 337-362, February.
    4. Jonathan Eckstein, 1993. "Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 202-226, February.
    5. 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. 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.
    2. 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.

    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. 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.
    2. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    3. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods," Computational Optimization and Applications, Springer, vol. 51(2), pages 649-679, March.
    4. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    5. T. Bittencourt & O. P. Ferreira, 2017. "Kantorovich’s theorem on Newton’s method under majorant condition in Riemannian manifolds," Journal of Global Optimization, Springer, vol. 68(2), pages 387-411, June.
    6. Erik Alex Papa Quiroz & Nancy Baygorrea Cusihuallpa & Nelson Maculan, 2020. "Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 879-898, September.
    7. Papa Quiroz, E.A. & Roberto Oliveira, P., 2012. "An extension of proximal methods for quasiconvex minimization on the nonnegative orthant," European Journal of Operational Research, Elsevier, vol. 216(1), pages 26-32.
    8. Regina Sandra Burachik & B. F. Svaiter, 2001. "A Relative Error Tolerance for a Family of Generalized Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 816-831, November.
    9. Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Paulo Roberto Oliveira & João Carlos Oliveira Souza, 2019. "Computing Riemannian Center of Mass on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 977-992, December.
    10. Glaydston C. Bento & Orizon P. Ferreira & Jefferson G. Melo, 2017. "Iteration-Complexity of Gradient, Subgradient and Proximal Point Methods on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 548-562, May.
    11. Emanuel Laude & Peter Ochs & Daniel Cremers, 2020. "Bregman Proximal Mappings and Bregman–Moreau Envelopes Under Relative Prox-Regularity," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 724-761, March.
    12. K. C. Kiwiel, 1998. "Subgradient Method with Entropic Projections for Convex Nondifferentiable Minimization," Journal of Optimization Theory and Applications, Springer, vol. 96(1), pages 159-173, January.
    13. Bonettini, Silvia & Prato, Marco & Rebegoldi, Simone, 2016. "A cyclic block coordinate descent method with generalized gradient projections," Applied Mathematics and Computation, Elsevier, vol. 286(C), pages 288-300.
    14. M. Kyono & M. Fukushima, 2000. "Nonlinear Proximal Decomposition Method for Convex Programming," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 357-372, August.
    15. Bingsheng He & Li-Zhi Liao & Xiang Wang, 2012. "Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments," Computational Optimization and Applications, Springer, vol. 51(2), pages 681-708, March.
    16. Orizon P. Ferreira & Mauricio S. Louzeiro & Leandro F. Prudente, 2020. "Iteration-Complexity and Asymptotic Analysis of Steepest Descent Method for Multiobjective Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 507-533, February.
    17. Jonathan Eckstein & Paulo Silva, 2010. "Proximal methods for nonlinear programming: double regularization and inexact subproblems," Computational Optimization and Applications, Springer, vol. 46(2), pages 279-304, June.
    18. Regina S. Burachik & Minh N. Dao & Scott B. Lindstrom, 2021. "Generalized Bregman Envelopes and Proximity Operators," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 744-778, September.
    19. M. V. Solodov & B. F. Svaiter, 2000. "An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 214-230, May.
    20. Spyridon Pougkakiotis & Jacek Gondzio, 2021. "An interior point-proximal method of multipliers for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 78(2), pages 307-351, March.

    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:139:y:2008:i:2:d:10.1007_s10957-008-9422-2. 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.