Metraipolis › archive › dc_df3e4edfd08e
Variance-Reduced Stochastic Quasi-Newton SQCQP Method for Nonlinear Programming Problems — arXiv:2611.04403
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04403
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:45:17.741Z
- SHA-256 of the archived text
b5fd60d39eca9e5115c84904ee4a59201a3348d28cc72aaf503b2ebbb238188c- Stable URL of this page
https://metraipolis.com/documento/dc_df3e4edfd08e
How to cite
Variance-Reduced Stochastic Quasi-Newton SQCQP Method for Nonlinear Programming Problems — arXiv:2611.04403 — arXiv (en), https://arxiv.org/abs/2611.04403 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df3e4edfd08e (Metraipolis archive dc_df3e4edfd08e, sha256 b5fd60d39eca9e5115c84904ee4a59201a3348d28cc72aaf503b2ebbb238188c)
BibTeX
@misc{dcdf3e4edfd08e,
title = {Variance-Reduced Stochastic Quasi-Newton SQCQP Method for Nonlinear Programming Problems — arXiv:2611.04403},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04403},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df3e4edfd08e; sha256 b5fd60d39eca9e5115c84904ee4a59201a3348d28cc72aaf503b2ebbb238188c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04403. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we propose a variance-reduced stochastic quasi-Newton sequential quadratic constrained quadratic programming method (VR-QN-SQCQP) for finite-sum nonlinear optimization with equality and inequality constraints. Exact nonlinear-constraint Hessians are replaced entirely by safeguarded symmetric rank-one (SR1) curvature models built from first-order constraint gradients, while PAGE estimates the objective gradient and an exact \(L_1\) merit function provides globalization. Under explicit regularity, boundedness, relative QCQP-accuracy, and step-length assumptions, the analysis establishes almost-sure subsequential convergence to Karush--Kuhn--Tucker (KKT) points and, under stronger uniform step-length and error-control conditions, an expected \(O(\varepsilon^{-2})\) outer-iteration bound for the squared KKT residual. A conditional local stability result also compares learned-curvature directions with their exact-Hessian counterparts. Numerical experiments compare VR-QN-SQCQP against Exact-SQCQP-PAGE on Sparse PCA using 253,680 CDC BRFSS 2015 observations and on a dense nonlinear benchmark. Over ten seeds, both methods converge in all Sparse PCA runs, while on the dense benchmark the proposed method converges in 10/10 runs versus 9/10 for the exact-Hessian variant. The proposed method performs zero exact constraint-Hessian evaluations and reduces median curvature-construction time on the dense benchmark from 0.1230 s to 0.0111 s. Overall runtime benefits remain problem-dependent.
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.04403 — 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-04T12:31:32.253Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).