Idioma:

A subgradient method for multiobjective optimization

Da Cruz Neto, J. X. ; Da Silva, G. J. P. ; Ferreira, O. P. ; Lopes, J. O.

Computational optimization and applications, 2013-04, Vol.54 (3), p.461-472 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
A subgradient method for multiobjective optimization
Autor: Da Cruz Neto, J. X. ; Da Silva, G. J. P. ; Ferreira, O. P. ; Lopes, J. O.
Assuntos: Computation ; Convergence ; Convex and Discrete Geometry ; Euclidean space ; Inequality ; Management Science ; Mathematics ; Mathematics and Statistics ; Minimization ; Operations Research ; Operations Research/Decision Theory ; Optimization ; Pareto optimality ; Statistics
É parte de: Computational optimization and applications, 2013-04, Vol.54 (3), p.461-472
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: 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.
Editor: Boston: Springer US
Idioma: Inglês

Voltar para lista de resultados