Nonsmooth multiobjective programming with quasi-Newton methods

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.

MoreLess

Year of publication:	2014
Authors:	Qu, Shaojian ; Liu, Chen ; Goh, Mark ; Li, Yijun ; Ji, Ying
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 235.2014, 3, p. 503-510
Publisher:	Elsevier
Subject:	Multiobjective programming \| Pareto optimality \| Critical point \| Quasi-Newton methods

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010871295