A subgradient method for multiobjective optimization

Authors:
J. X. Cruz Neto;G. J. Silva;O. P. Ferreira;J. O. Lopes
Affiliations:
DM, Universidade Federal do Piauí, Teresina, Brazil 64049-500;IME, Universidade Federal de Goiás, Goiânia, Brazil 74001-970;IME, Universidade Federal de Goiás, Goiânia, Brazil 74001-970;DM, Universidade Federal do Piauí, Teresina, Brazil 64049-500
Venue:
Computational Optimization and Applications
Year:
2013

Citing 4
Cited 0

Entropy-like proximal methods in convex programming

Mathematics of Operations Research
A Projected Gradient Method for Vector Optimization Problems

Computational Optimization and Applications
A steepest descent method for vector optimization

Journal of Computational and Applied Mathematics
Algorithms for the quasiconvex feasibility problem

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.