IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01463765.html
   My bibliography  Save this paper

A Proximal Point-Type Method for Multicriteria Optimization

Author

Listed:
  • Glaydston Carvalho Bento
  • J.X. Cruz Neto
  • Antoine Soubeyran

    (GREQAM - Groupement de Recherche en Économie Quantitative d'Aix-Marseille - EHESS - École des hautes études en sciences sociales - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

Abstract

In this paper, we present a proximal point algorithm for multicriteria optimization, by assuming an iterative process which uses a variable scalarization function. With respect to the convergence analysis, firstly we show that, for any sequence generated from our algorithm, each accumulation point is a Pareto critical point for the multiobjective function. A more significant novelty here is that our paper gets full convergence for quasi-convex functions. In the convex or pseudo-convex cases, we prove convergence to a weak Pareto optimal point. Another contribution is to consider a variant of our algorithm, obtaining the iterative step through an unconstrained subproblem. Then, we show that any sequence generated by this new algorithm attains a Pareto optimal point after a finite number of iterations under the assumption that the weak Pareto optimal set is weak sharp for the multiobjective problem.

Suggested Citation

  • Glaydston Carvalho Bento & J.X. Cruz Neto & Antoine Soubeyran, 2014. "A Proximal Point-Type Method for Multicriteria Optimization," Post-Print hal-01463765, HAL.
    • Handle: RePEc:hal:journl:hal-01463765
    DOI: 10.1007/s11228-014-0279-2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Antoine Soubeyran & João Carlos Oliveira Souza, 2020. "A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems," Computational Optimization and Applications, Springer, vol. 75(1), pages 263-290, January.
    2. H. Apolinário & E. Papa Quiroz & P. Oliveira, 2016. "A scalarization proximal point method for quasiconvex multiobjective minimization," Journal of Global Optimization, Springer, vol. 64(1), pages 79-96, January.
    3. 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.
    4. 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.
    5. Glaydston de C. Bento & João Xavier Cruz Neto & Lucas V. Meireles, 2018. "Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization of Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 37-52, October.
    6. 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.
    7. Erik Alex Papa Quiroz & Hellena Christina Fernandes Apolinário & Kely Diana Villacorta & Paulo Roberto Oliveira, 2019. "A Linear Scalarization Proximal Point Method for Quasiconvex Multiobjective Minimization," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 1028-1052, December.
    8. Ying Ji & Mark Goh & Robert Souza, 2016. "Proximal Point Algorithms for Multi-criteria Optimization with the Difference of Convex Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 169(1), pages 280-289, April.

    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:hal:journl:hal-01463765. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.