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

From MaRDI portal
Publication:458364

DOI10.1016/J.JMAA.2014.09.001zbMATH Open1304.49032arXiv1406.1694OpenAlexW1992296912MaRDI QIDQ458364FDOQ458364


Authors: Guillaume Garrigos, Xavier Goudou, Hédy Attouch Edit this on Wikidata


Publication date: 7 October 2014

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1406.1694




Recommendations




Cites Work


Cited In (7)





This page was built for publication: A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458364)