arXiv (All)
open access
Convergence of a Randomized Newton Method in Nonconvex Optimization
We analyze a stochastic Newton optimization scheme for locating the unique global minimizer of a general nonconvex objective function. The method couples a Newton algorithm to additive Gaussian noise with state-dependent variance. In the bounded domain setting, we prove global almost sure convergenc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence#974178
- The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives#985882
- A Contraction Framework for Stochastic Operators with Bootstrapping: Application to TD Learning#1078032
- A preconditioning proximal Newton method for nondifferentiable convex optimization#429983
- Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification#1154795
Record · ID 997344
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive