On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems

Authors Oliver Schütze, Alessandro Dell'Aere, Michael Dellnitz

Thumbnail PDF


  • Filesize: 2.61 MB
  • 15 pages

Document Identifiers

Author Details

Oliver Schütze
Alessandro Dell'Aere
Michael Dellnitz

Cite AsGet BibTex

Oliver Schütze, Alessandro Dell'Aere, and Michael Dellnitz. On Continuation Methods for the Numerical Treatment of Multi-Objective Optimization Problems. In Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Volume 4461, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


In this report we describe how continuation methods can be used for the numerical treatment of multi-objective optimization problems (MOPs): starting with a given Karush-Kuhn-Tucker point (KKT-point) x of an MOP, these techniques can be applied to detect further KKT-points in the neighborhood of x. In the next step, again further points are computed starting with these new-found KKT-points, and so on. In order to maintain a good spread of these solutions we use boxes for the representation of the computed parts of the solution set. Based on this background, we propose a new predictor-corrector variant, and show some numerical results indicating the strength of the method, in particular in higher dimensions. Further, the data structure allows for an efficient computation of MOPs with more than two objectives, which has not been considered so far in most existing continuation methods.
  • multi-objective optimization
  • continuation
  • k-manifolds


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail