Nonsmooth multiobjective programming with quasi-Newton methods

Shaojian Qu

doi:10.1016/j.ejor.2014.01.022

Nonsmooth multiobjective programming with quasi-Newton methods

2014-06-01

29

PRE

AI

DOI：10.1016/j.ejor.2014.01.022

原文链接

原文求助

摘要

En 中文

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. (C) 2014 Elsevier B.V. All rights reserved.

Keyword:

Multiobjective programming

Pareto optimality

Critical point

Quasi-Newton methods

Nonsmooth multiobjective programming with quasi-Newton methods

摘要

期刊

机构