@techreport{desideri:inria-00389811, TITLE = {{Multiple-Gradient Descent Algorithm (MGDA)}}, AUTHOR = {D{\'e}sid{\'e}ri, Jean-Antoine}, URL = {https://hal.inria.fr/inria-00389811}, NOTE = {In this report, the problem of minimizing simultaneously n smooth and unconstrained criteria is considered. A descent direction common to all the criteria is identified, knowing all the gradients. An algorithm is defined in which the optimization process is carried out in two phases : one that is cooperative yielding to the Pareto front, and the other optional and competitive.}, TYPE = {Research Report}, NUMBER = {RR-6953}, PAGES = {17}, YEAR = {2009}, MONTH = Jun, KEYWORDS = {Optimum--shape design ; concurrent engineering ; multi-criterion optimization ; split of territory ; Nash and Stackelberg game strategies ; Pareto optimality ; descent direction ; steepest-descent direction}, PDF = {https://hal.inria.fr/inria-00389811/file/rr6953.pdf}, HAL_ID = {inria-00389811}, HAL_VERSION = {v3}, }