A cubic regularization method for multiobjective optimization that finds approximate Pareto-critical points in O(epsilon^-3/2) iterations under standard smoothness assumptions.
Title resolution pending
1 Pith paper cite this work, alongside 39 external citations. Polarity classification is still indexing.
1
Pith paper citing it
39
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Cubic Regularization Method for Multiobjective Optimization
A cubic regularization method for multiobjective optimization that finds approximate Pareto-critical points in O(epsilon^-3/2) iterations under standard smoothness assumptions.