.png){kind=icon}
.png){kind=icon}
Return
Second-Order Online Nonconvex Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2020.3040372.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present the online Newton's method, a single-step second-order method for online nonconvex optimization. We analyze its performance and obtain a dynamic regret bound that is linear in the cumulative variation between round optima. We show that if the variation between round optima is limited, the method leads to a constant regret bound. In the general case, the online Newton's method outperforms online convex optimization algorithms for convex functions and performs similarly to a specialized algorithm for strongly convex functions. We simulate the performance of the online Newton's method on a nonlinear, nonconvex moving target localization example and find that it outperforms a first-order approach.
Keywords:
Optimization
Heuristic algorithms
Newton method
Convex functions
Radio frequency
Prediction algorithms
Mirrors
Moving target localization
Newton's method
online nonconvex
convex optimization
time-varying optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations