Metraipolis › archive › dc_cc50caee0c9c
A globally convergent stochastic semismooth Newton method for strongly convex problems in Hilbert spaces — arXiv:2611.08061
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08061
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:01.899Z
- SHA-256 of the archived text
c794e38fb270c66310ace75529fbd6379776b01300184c1dce5d827beb8593b9- Stable URL of this page
https://metraipolis.com/documento/dc_cc50caee0c9c
How to cite
A globally convergent stochastic semismooth Newton method for strongly convex problems in Hilbert spaces — arXiv:2611.08061 — arXiv (en), https://arxiv.org/abs/2611.08061 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc50caee0c9c (Metraipolis archive dc_cc50caee0c9c, sha256 c794e38fb270c66310ace75529fbd6379776b01300184c1dce5d827beb8593b9)
BibTeX
@misc{dccc50caee0c9c,
title = {A globally convergent stochastic semismooth Newton method for strongly convex problems in Hilbert spaces — arXiv:2611.08061},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08061},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc50caee0c9c; sha256 c794e38fb270c66310ace75529fbd6379776b01300184c1dce5d827beb8593b9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08061. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We propose and analyze a globalized stochastic semismooth Newton method for stochastic optimization problems in Hilbert spaces where the objective is strongly convex with Lipschitz continuous, Newton differentiable gradient. Gradient and generalized Hessian information are only available through mini-batching. In each iteration, a full semismooth Newton trial step is accepted or rejected based on a stochastic residual test and rejected steps are replaced by damped steps in the same Newton direction. Throughout, we admit gradient estimators with affinely growing variance, as arises in optimization problems with random partial differential equations as constraints. We prove non-asymptotic global R-linear convergence in expectation as well as almost sure convergence. For sufficiently fast-growing batch sizes, the method transitions almost surely into a regime of pure Newton steps and converges R-superlinearly almost surely. The method is applied to the optimal control of a random elliptic equation featuring a Huber tracking term as well as a random parabolic equation with a Moreau--Yosida penalization of an almost sure state constraint. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.08061 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:23:27.651Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).