Variance-Reduced First-Order Methods for Deterministically Constrained Stochastic Nonconvex Optimization with Strong Convergence Guarantees
SIAM Journal on Optimization · 31.03.2026 · 36 (1) · 1-31
DOI: 10.1137/24m1693933 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Optimization, online erschienen am 02.01.2026. Verfasst von Zhaosong Lu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: Office of Naval Research, Air Force Office of Scientific Research, National Science Foundation.
Abstract (Originalsprache)
In this paper, we study a class of deterministically constrained stochastic nonconvex optimization problems. Existing methods typically aim to find an [Formula: see text]- expectedly feasible stochastic stationary point, where the expected violations of both constraints and first-order stationarity are within a prescribed tolerance [Formula: see text]. However, in many practical applications, it is crucial that the constraints be nearly satisfied with certainty, making such an [Formula: see text]-stochastic stationary point potentially undesirable due to the risk of substantial constraint violations. To address this issue, we propose single-loop variance-reduced stochastic first-order methods, where the stochastic gradient of the stochastic component is computed using either a truncated recursive momentum scheme or a truncated Polyak momentum scheme for variance reduction, while the gradient of the deterministic component is computed exactly. Under the error bound condition with a parameter [Formula: see text] and other suitable assumptions, we establish that these methods respectively achieve sample complexity and first-order oracle complexity of [Formula: see text] and [Formula: see text] for finding an [Formula: see text]- surely feasible stochastic stationary point ([Formula: see text] represents [Formula: see text] with logarithmic factors hidden), where the constraint violation is within [Formula: see text] with certainty, and the expected violation of first-order stationarity is within [Formula: see text]. For [Formula: see text], these complexities reduce to [Formula: see text] and [Formula: see text], respectively, which match, up to a logarithmic factor, the best-known complexities achieved by existing methods for finding an [Formula: see text]-stochastic stationary point of unconstrained smooth stochastic nonconvex optimization problems.
Förderung
- Office of Naval Research
- Air Force Office of Scientific Research
- National Science Foundation
Zitieren
APA
Lu, Z., Mei, S., & Xiao, Y. (2026). Variance-Reduced First-Order Methods for Deterministically Constrained Stochastic Nonconvex Optimization with Strong Convergence Guarantees. SIAM Journal on Optimization, 36(1), 1-31. https://doi.org/10.1137/24m1693933
Vancouver
Lu Z, Mei S, Xiao Y. Variance-Reduced First-Order Methods for Deterministically Constrained Stochastic Nonconvex Optimization with Strong Convergence Guarantees. SIAM Journal on Optimization. 2026;36(1):1-31. doi:10.1137/24m1693933
BibTeX
@article{Lu2026,
author = {Lu, Zhaosong and Mei, Sanyou and Xiao, Yifeng},
title = {Variance-Reduced First-Order Methods for Deterministically Constrained Stochastic Nonconvex Optimization with Strong Convergence Guarantees},
journal = {SIAM Journal on Optimization},
year = {2026},
volume = {36},
number = {1},
pages = {1--31},
doi = {10.1137/24m1693933}
}
EUVIMED