Metraipolis › archive › dc_f0ffc47f591f
Damped stochastic mirror descent for non-smooth ill-posed problems in Banach space — arXiv:2610.38258
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38258
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:32:23.654Z
- SHA-256 of the archived text
5a57d7775fbcf3e419be591d9e9e37eea32ab2227933cf4995183e573589d5ec- Stable URL of this page
https://metraipolis.com/documento/dc_f0ffc47f591f
How to cite
Damped stochastic mirror descent for non-smooth ill-posed problems in Banach space — arXiv:2610.38258 — arXiv (en), https://arxiv.org/abs/2610.38258 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f0ffc47f591f (Metraipolis archive dc_f0ffc47f591f, sha256 5a57d7775fbcf3e419be591d9e9e37eea32ab2227933cf4995183e573589d5ec)
BibTeX
@misc{dcf0ffc47f591f,
title = {Damped stochastic mirror descent for non-smooth ill-posed problems in Banach space — arXiv:2610.38258},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38258},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f0ffc47f591f; sha256 5a57d7775fbcf3e419be591d9e9e37eea32ab2227933cf4995183e573589d5ec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38258. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a damped variant of the stochastic mirror descent method for systems of non-smooth nonlinear ill-posed operator equations in Banach spaces. At each iteration, the method samples a random subset of the equations, performs a mirror-descent step in the dual space with an adaptive step size derived from the discrepancy principle, and applies a damping term that prevents the iterates from drifting away from the initial guess. The scheme accommodates non-smooth forward operators through a family of bounded linear surrogates, admits general $p$-convex penalty functionals which also includes trained convex penalty, allows the noise level to differ from equation to equation, and dispenses with two classical requirements, namely reflexivity of the image space and Gâteaux differentiability of the forward operator. We study its regularization properties under an \textit{a posteriori} stopping rule by proving first that the iteration terminates after finitely many steps almost surely, and then that the mean-square error of the iterates tends to zero as the noise level vanishes. Numerical experiments on a system of non-smooth semilinear inverse source problems and the identification of a diffusion coefficient confirm the theoretical analysis and shows improved convergence results.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.38258 — 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-01T02:14:28.342Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).