A subgradient method for multiobjective optimization

A method for solving quasiconvex nondifferentiable unconstrained multiobjective optimization problems is proposed in this paper. This method extends to the multiobjective case of the classical subgradient method for real-valued minimization. Assuming the basically componentwise quasiconvexity of the objective components, full convergence (to Pareto optimal points) of all the sequences produced by the method is established. Copyright Springer Science+Business Media, LLC 2013

MoreLess

Year of publication:	2013
Authors:	Neto, J. Cruz ; Silva, G. ; Ferreira, O. ; Lopes, J.
Published in:	Computational Optimization and Applications. - Springer. - Vol. 54.2013, 3, p. 461-472
Publisher:	Springer
Subject:	Pareto optimality or efficiency \| Multiobjective optimization \| Subgradient method \| Quasi-Féjer convergence

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

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