EUVIMEDEUVIMED entdecken
Crossref

A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees

Chuan He, Zhaosong Lu

SIAM Journal on Optimization · 30.06.2023 · 33 (2) · 1191-1222

DOI: 10.1137/21m1457011 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 26.06.2023. Verfasst von Chuan He und 1 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper we consider finding an approximate second-order stationary point (SOSP) of nonconvex conic optimization that minimizes a twice differentiable function over the intersection of an affine subspace and a convex cone. In particular, we propose a Newton–conjugate gradient based barrier method for finding an [Formula: see text]-SOSP of this problem. Our method not only is implementable but also achieves an iteration complexity of [Formula: see text], which matches the best known iteration complexity of second-order methods for finding an [Formula: see text]-SOSP of unconstrained nonconvex optimization. The operation complexity, consisting of [Formula: see text] Cholesky factorizations and [Formula: see text] other fundamental operations, is also established for our method, where n is the problem dimension and [Formula: see text] represents [Formula: see text] with logarithmic terms omitted.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

He, C., & Lu, Z. (2023). A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees. SIAM Journal on Optimization, 33(2), 1191-1222. https://doi.org/10.1137/21m1457011

Vancouver

He C, Lu Z. A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees. SIAM Journal on Optimization. 2023;33(2):1191-1222. doi:10.1137/21m1457011

BibTeX
@article{He2023,
  author = {He, Chuan and Lu, Zhaosong},
  title = {A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees},
  journal = {SIAM Journal on Optimization},
  year = {2023},
  volume = {33},
  number = {2},
  pages = {1191--1222},
  doi = {10.1137/21m1457011}
}
Kostenlos starten →