Proximal point algorithm achieves O(ε^{-1}) complexity for quasar-convex functions and linear convergence with O(ln(ε^{-1})) for strongly quasar-convex functions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Robust learning problems are formulated as quasar-convex optimization, and HiPPA is proposed as an inexact high-order proximal method with global and superlinear convergence guarantees.
citing papers explorer
-
Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
Proximal point algorithm achieves O(ε^{-1}) complexity for quasar-convex functions and linear convergence with O(ln(ε^{-1})) for strongly quasar-convex functions.
-
Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
Robust learning problems are formulated as quasar-convex optimization, and HiPPA is proposed as an inexact high-order proximal method with global and superlinear convergence guarantees.