Skip to main navigation Skip to search Skip to main content

Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

In this note, we consider the iteration complexity of solving strongly convex multi-objective optimization problems. We discuss the precise meaning of this problem, noting that its definition is ambiguous, and focus on the most natural notion of finding a set of Pareto optimal points across a grid of scalarized problems. We prove that, in most cases, performing sensitivity based path-following after obtaining one solution is the optimal strategy for this task in terms of iteration complexity.

Original languageEnglish
Pages (from-to)1215-1227
Number of pages13
JournalOptimization Letters
Volume15
Issue number4
DOIs
StatePublished - Jun 2021
Externally publishedYes

Funding

We would like to thank two anonymous referees for their careful readings and corrections that helped us to improve our manuscript significantly. E. Bergou received support from the AgreenSkills+ fellowship programme which has received funding from the EU’s Seventh Framework Programme under Grant Agreement No. FP7-609398 (AgreenSkills+ contract). V. Kungurtsev received support from the OP VVV Project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics”.

Keywords

  • Complexity analysis
  • Multi-objective optimization
  • Newton method
  • Path-following
  • Strongly convex optimization

Fingerprint

Dive into the research topics of 'Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure'. Together they form a unique fingerprint.

Cite this