The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
Fiche du document
- handle: 10670/1.kgpxqr
- hal: hal-01985333
- doi: 10.1137/16M107534X
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/doi/10.1137/16M107534X
info:eu-repo/semantics/OpenAccess
Sujets proches
Analysis (Mathematics)Citer ce document
G. Bento et al., « The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem », HAL-SHS : économie et finance, ID : 10.1137/16M107534X
Métriques
Partage / Export
Résumé
This paper studies the constrained multiobjective optimization problem of finding Pareto critical points of vector-valued functions. The proximal point method considered by Bonnel, Iusem, and Svaiter [SIAM J. Optim., 15 (2005), pp. 953--970] is extended to locally Lipschitz functions in the finite dimensional multiobjective setting. To this end, a new (scalarization-free) approach for convergence analysis of the method is proposed where the first-order optimality condition of the scalarized problem is replaced by a necessary condition for weak Pareto points of a multiobjective problem. As a consequence, this has allowed us to consider the method without any assumption of convexity over the constraint sets that determine the vectorial improvement steps. This is very important for applications; for example, to extend to a dynamic setting the famous compromise problem in management sciences and game theory.