El Moudden, M. and El Ghali, A. (2018) Multiple reduced gradient method for multiobjective optimization problems. Numerical Algorithms, 79 (4). pp. 1257-1282.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

Multiobjective optimization has a large number of real-life applications. Under this motivation, in this paper, we present a new method for solving multiobjective optimization problems with both linear constraints and bound constraints on the variables. This method extends, to the multiobjective setting, the classical reduced gradient method for scalar-valued optimization. The proposed algorithm generates a feasible descent direction by solving an appropriate quadratic subproblem, without the use of any scalarization approaches. We prove that the sequence generated by the algorithm converges to Pareto-critical points of the problem. We also present some numerical results to show the efficiency of the proposed method. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Item Type: Article
Subjects: Mathematics
Divisions: SCIENTIFIC PRODUCTION > Mathematics
Depositing User: Administrateur Eprints Administrateur Eprints
Last Modified: 31 Jan 2020 15:48
URI: http://eprints.umi.ac.ma/id/eprint/3887

Actions (login required)

View Item View Item