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

arXiv: https://arxiv.org/abs/2004.02979 · HTML: https://mlsanity.com/paper/2004.02979/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Apr 2020.

## Built on by (most cited first, 1 of 1)

- [UMOEA/D: A Multiobjective Evolutionary Algorithm for Uniform Pareto Objectives based on Decomposition](https://mlsanity.com/paper/2402.09486/) (2024)

## Abstract (arXiv)

In this note we consider the iteration complexity of solving strongly convex multi objective optimization. We discuss the precise meaning of this problem, and indicate it is loosely defined, but the most natural notion is to find a set of Pareto optimal points across a grid of scalarized problems. We derive 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.