A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2014

A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions

Résumé

In a general Hilbert framework, we consider continuous gradient-like dynamical systems for constrained multiobjective optimization involving non-smooth convex objective functions. Our approach is in the line of a previous work where was considered the case of convex di erentiable objective functions. Based on the Yosida regularization of the subdi erential operators involved in the system, we obtain the existence of strong global trajectories. We prove a descent property for each objective function, and the convergence of trajectories to weak Pareto minima. This approach provides a dynamical endogenous weighting of the objective functions. Applications are given to cooperative games, inverse problems, and numerical multiobjective optimization.
Fichier principal
Vignette du fichier
AGG_140605_arXiv.pdf (296.14 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01002541 , version 1 (06-06-2014)

Identifiants

Citer

Hedy Attouch, Guillaume Garrigos, Xavier Goudou. A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions. 2014. ⟨hal-01002541⟩
239 Consultations
162 Téléchargements

Altmetric

Partager

More