Nonsmooth multiobjective programming with quasi-Newton methods

•A nonsmooth quasi-Newton algorithm is proposed for solving nonsmooth multiple objective programming.•A tractable subproblem is solved to obtain the descent direction.•The global and local convergence results for the new algorithm are presented under reasonable assumptions.•The efficiency of the new...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 235; H. 3; S. 503 - 510
Hauptverfasser: Qu, Shaojian, Liu, Chen, Goh, Mark, Li, Yijun, Ji, Ying
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 16.06.2014
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Convergence
Critical point
Descent
Goal programming
Mathematical programming
Multiobjective programming
Multiple objective
Operational research
Pareto optimality
Pareto optimum
Quasi-Newton methods
Studies
Pareto optimality
Critical point
Quasi-Newton methods
Multiobjective programming
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•A nonsmooth quasi-Newton algorithm is proposed for solving nonsmooth multiple objective programming.•A tractable subproblem is solved to obtain the descent direction.•The global and local convergence results for the new algorithm are presented under reasonable assumptions.•The efficiency of the new algorithm is shown by a numerical example. This paper proposes a new algorithm to solve nonsmooth multiobjective programming. The algorithm is a descent direction method to obtain the critical point (a necessary condition for Pareto optimality). We analyze both global and local convergence results under some assumptions. Numerical tests are also given.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2014.01.022