Home ›
Entities
› academia
› An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization
An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization
Research article (IMA Journal of Numerical Analysis, 2018) · cited 25× · AI/ML
An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization
Summary
An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization is a scholarly article[1].
Key Facts
An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-inexact-regularized-newton-framework-with-a-worst-case-iteration-complexity-of-mathscr-o-varepsilon-3-2-for-nonconvex
MLA“An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-inexact-regularized-newton-framework-with-a-worst-case-iteration-complexity-of-mathscr-o-varepsilon-3-2-for-nonconvex.
BibTeX@misc{4ortxyz_an-inexact-regularized-newton-framework-with-a-worst-case-iteration-complexity-of-mathscr-o-varepsilon-3-2-for-nonconvex_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization}}, year = {2026}, url = {https://4ort.xyz/entity/an-inexact-regularized-newton-framework-with-a-worst-case-iteration-complexity-of-mathscr-o-varepsilon-3-2-for-nonconvex}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization — https://4ort.xyz/entity/an-inexact-regularized-newton-framework-with-a-worst-case-iteration-complexity-of-mathscr-o-varepsilon-3-2-for-nonconvex (retrieved 2026-05-24)
