Decentralized Cubic Newton method for convex optimization that matches exact centralized iteration complexity with polylogarithmic extra communication rounds under gradient L1-smoothness and Hessian L2-Lipschitz continuity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Decentralized Inexact Cubic Newton Method with Consensus Procedure
Decentralized Cubic Newton method for convex optimization that matches exact centralized iteration complexity with polylogarithmic extra communication rounds under gradient L1-smoothness and Hessian L2-Lipschitz continuity.