Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure
OPTIMIZATION LETTERS(2020)
摘要
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.
更多查看译文
关键词
Multi-objective optimization, Strongly convex optimization, Path-following, Newton method, Complexity analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络