Explicit gradient information in multiobjective optimization

Authors:
Ubaldo M. GarcíA-Palomares;Juan C. Burguillo-Rial;Francisco J. GonzáLez-CastañO
Affiliations:
Departamento de Ingeniería Telemática, Universidade de Vigo, Lagoas-Marcosende s/n, 36310 Vigo, Spain and Departamento de Procesos y Sistemas, Universidad Simón Bolívar, Valle ...;Departamento de Ingeniería Telemática, Universidade de Vigo, Lagoas-Marcosende s/n, 36310 Vigo, Spain;Departamento de Ingeniería Telemática, Universidade de Vigo, Lagoas-Marcosende s/n, 36310 Vigo, Spain
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 0

On combining feasibility, descent and superlinear convergence in inequality constrained optimization

Mathematical Programming: Series A and B
New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization

SIAM Journal on Optimization
A steepest descent method for vector optimization

Journal of Computational and Applied Mathematics
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents an algorithm that converges to points that satisfy a first-order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints on how to include second-order information are given. Preliminary numerical results are encouraging.