An efficient descent method for locally Lipschitz multiobjective optimization problems

In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-04
Hauptverfasser:	Gebken, Bennet, Peitz, Sebastian
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Descent Mathematical programming Mathematics - Optimization and Control Mopping Multiple objective analysis Pareto optimization Pareto optimum
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!