Complexity Iteration Analysis for Strongly Convex Multi-objective Optimization Using a Newton Path-following Procedure

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00342256" target="_blank" >RIV/68407700:21230/21:00342256 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s11590-020-01623-x" target="_blank" >https://doi.org/10.1007/s11590-020-01623-x</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11590-020-01623-x" target="_blank" >10.1007/s11590-020-01623-x</a>

Result language
angličtina
Original language name
Complexity Iteration Analysis for Strongly Convex Multi-objective Optimization Using a Newton Path-following Procedure
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)