Skip to Main content Skip to Navigation
Journal articles

The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-01985333
Contributor : Elisabeth Lhuillier <>
Submitted on : Thursday, January 17, 2019 - 7:36:16 PM
Last modification on : Wednesday, August 5, 2020 - 3:17:52 AM

Links full text

Identifiers

Collections

Citation

G. Bento, J. Cruz Neto, G. López, J. Souza, Antoine Soubeyran. The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2018, 28 (2), pp.1104-1120. ⟨10.1137/16M107534X⟩. ⟨hal-01985333⟩

Share

Metrics

Record views

83