A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Non-Convex Optimization
Not on the map. Why?
Abstract (arXiv)
Motivated by TRACE algorithm [Curtis et al. 2017], we propose a trust region algorithm for finding second order stationary points of a linearly constrained non-convex optimization problem. We show the convergence of the proposed algorithm to (εg, εH)-second order stationary points in widetildeO(maxεg-3/2, εH-3) iterations. This iteration complexity is achieved for general linearly constrained optimization without cubic regularization of the objective function.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.