IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v159y2013i1d10.1007_s10957-013-0305-9.html
   My bibliography  Save this article

An Inexact Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds

Author

Listed:
  • G. C. Bento

    (Universidade Federal de Goiás)

  • J. X. Cruz Neto

    (Universidade Federal Piauí)

  • P. S. M. Santos

    (Universidade Federal Piauí)

Abstract

In this paper, we present an inexact version of the steepest descent method with Armijo’s rule for multicriteria optimization in the Riemannian context given in Bento et al. (J. Optim. Theory Appl., 154: 88–107, 2012). Under mild assumptions on the multicriteria function, we prove that each accumulation point (if any) satisfies first-order necessary conditions for Pareto optimality. Moreover, assuming that the multicriteria function is quasi-convex and the Riemannian manifold has nonnegative curvature, we show full convergence of any sequence generated by the method to a Pareto critical point.

Suggested Citation

  • G. C. Bento & J. X. Cruz Neto & P. S. M. Santos, 2013. "An Inexact Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 108-124, October.
    • Handle: RePEc:spr:joptap:v:159:y:2013:i:1:d:10.1007_s10957-013-0305-9
    DOI: 10.1007/s10957-013-0305-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0305-9
    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-013-0305-9?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. Glaydston C. Bento & Jefferson G. Melo, 2012. "Subgradient Method for Convex Feasibility on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 773-785, March.
    2. J. H. Wang & G. López & V. Martín-Márquez & C. Li, 2010. "Monotone and Accretive Vector Fields on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 146(3), pages 691-708, September.
    3. Ellen Fukuda & L. Graña Drummond, 2013. "Inexact projected gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 473-493, April.
    4. L. C. Ceng & B. S. Mordukhovich & J. C. Yao, 2010. "Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 267-303, August.
    5. G. C. Bento & O. P. Ferreira & P. R. Oliveira, 2012. "Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 88-107, July.
    6. Jörg Fliege & Benar Fux Svaiter, 2000. "Steepest descent methods for multicriteria optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(3), pages 479-494, August.
    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. 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.
    2. Shahabeddin Najafi & Masoud Hajarian, 2023. "Multiobjective Conjugate Gradient Methods on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1229-1248, June.
    3. 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.
    4. Henri Bonnel & Léonard Todjihoundé & Constantin Udrişte, 2015. "Semivectorial Bilevel Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 464-486, November.
    5. Mounir El Maghri & Youssef Elboulqe, 2018. "Reduced Jacobian Method," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 917-943, December.
    6. N. Eslami & B. Najafi & S. M. Vaezpour, 2023. "A Trust Region Method for Solving Multicriteria Optimization Problems on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 212-239, January.
    7. João Carlos de O. Souza, 2018. "Proximal Point Methods for Lipschitz Functions on Hadamard Manifolds: Scalar and Vectorial Cases," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 745-760, December.

    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. X. M. Wang & J. H. Wang & C. Li, 2023. "Convergence of Inexact Steepest Descent Algorithm for Multiobjective Optimizations on Riemannian Manifolds Without Curvature Constraints," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 187-214, July.
    2. Bento, G.C. & Cruz Neto, J.X. & Oliveira, P.R. & Soubeyran, A., 2014. "The self regulation problem as an inexact steepest descent method for multicriteria optimization," European Journal of Operational Research, Elsevier, vol. 235(3), pages 494-502.
    3. G. C. Bento & J. X. Cruz Neto, 2013. "A Subgradient Method for Multiobjective Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 125-137, October.
    4. 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.
    5. Gonçalves, M.L.N. & Lima, F.S. & Prudente, L.F., 2022. "A study of Liu-Storey conjugate gradient methods for vector optimization," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    6. 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.
    7. Alfredo N. Iusem & Jefferson G. Melo & Ray G. Serra, 2021. "A Strongly Convergent Proximal Point Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 183-200, July.
    8. M. L. N. Gonçalves & L. F. Prudente, 2020. "On the extension of the Hager–Zhang conjugate gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 889-916, July.
    9. L. F. Prudente & D. R. Souza, 2022. "A Quasi-Newton Method with Wolfe Line Searches for Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 1107-1140, September.
    10. Shahabeddin Najafi & Masoud Hajarian, 2023. "Multiobjective Conjugate Gradient Methods on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 197(3), pages 1229-1248, June.
    11. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    12. Thai Chuong, 2013. "Newton-like methods for efficient solutions in vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 495-516, April.
    13. João Carlos de O. Souza, 2018. "Proximal Point Methods for Lipschitz Functions on Hadamard Manifolds: Scalar and Vectorial Cases," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 745-760, December.
    14. 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.
    15. J. X. Cruz Neto & F. M. O. Jacinto & P. A. Soares & J. C. O. Souza, 2018. "On maximal monotonicity of bifunctions on Hadamard manifolds," Journal of Global Optimization, Springer, vol. 72(3), pages 591-601, November.
    16. M. L. N. Gonçalves & F. S. Lima & L. F. Prudente, 2022. "Globally convergent Newton-type methods for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 83(2), pages 403-434, November.
    17. P. B. Assunção & O. P. Ferreira & L. F. Prudente, 2021. "Conditional gradient method for multiobjective optimization," Computational Optimization and Applications, Springer, vol. 78(3), pages 741-768, April.
    18. Qu, Shaojian & Ji, Ying & Jiang, Jianlin & Zhang, Qingpu, 2017. "Nonmonotone gradient methods for vector optimization with a portfolio optimization application," European Journal of Operational Research, Elsevier, vol. 263(2), pages 356-366.
    19. Suyun Liu & Luis Nunes Vicente, 2023. "Convergence Rates of the Stochastic Alternating Algorithm for Bi-Objective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 165-186, July.
    20. G. Cocchi & M. Lapucci, 2020. "An augmented Lagrangian algorithm for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 29-56, 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:159:y:2013:i:1:d:10.1007_s10957-013-0305-9. 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.