Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub

Section: New Results

Direct and adaptive approaches to multi-objective optimization

Participants : Jean-Antoine Désidéri, Régis Duvigneau.

We formulate in a unified way the major theoretical results obtained by the authors in the domain of multi-objective differential optimization, discuss illustrative examples, and present a brief discussion of the related software developments made at Inria. The development is split in two connected parts. In Part A, the Multiple Gradient Descent Algorithm (MGDA), referred to as the direct approach, is a general construction of a descent method in the multi-objective optimization context. The algorithm provides a technique for determining Pareto optimal solutions in constrained problems as an extension of the classical steepest-descent method. In Part B, another problematics is posed, referred to as the adaptive approach. It is meant to be developed after a Pareto-optimal solution with respect to a set of primary cost functions subject to constraints has been elected in a first phase of optimization carried out by application of MGDA, or another effective multi-objective optimization technique, possibly an evolutionary strategy. This second phase of optimization permits to construct a continuum of neighboring solutions for which novel cost functions, designated as secondary cost functions, are reduced at the cost of a moderate degradation of the Pareto-stationarity condition of the primary cost functions. In this way, the entire optimization process demonstrates a form of adaptivity to the result of the first phase [42].