Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 4 min ago
PreprintCC BY 4.0arXiv

Adaptive Variance-Reduced Stochastic Sequential (Quadratic Constrained) Quadratic Programming

Abstract

In this paper, we propose an adaptive variance-reduced stochastic sequential (quadratic constrained) quadratic programming (AVR-SS(QC)QP) method for nonlinear constrained optimization. The framework integrates SPIDER-based variance reduction, stochastic quasi-Newton curvature information, merit-function globalization, and adaptive switching between stochastic SQP and SQCQP models. The switching mechanism is governed by a relative constraint model curvature indicator that measures the second-order constraint information neglected by the linearized SQP model. A smoothed hysteresis rule ac?tivates the SQCQP model only when the relative constraint curvature is significant. An exact L1 merit function with Armijo backtracking globalizes the resulting directions, while a coupled stochastic Lyapunov analysis controls the interaction between gradient-estimation error and optimization progress. Under standard smoothness, sampling, regularity, and second-order conditions, we establish almost-sure consistency of the variance-reduced gradient estimator and global convergence of the KKT residual. We further show that, near regular KKT points, the curvature indicator vanishes and the method eventually selects the computationally cheaper SQP model. Numerical experiments on a sparse principal component analysis problem illustrate the practical be?havior of the proposed framework.

Related

  1. A sequential quadratic programming method for optimization with expectation objective functions, deterministic inequality constraints and robust subproblems
    Songqiang Qiu, Vyacheslav Kungurtsev
    IMA Journal of Numerical AnalysisPeer-reviewedLicence not statedFull text14 citedNumerical analysis & scientific computingOpenAlex
  2. Learning to Solve Mixed-Integer Nonlinear Programming with Neural Networks and Sequential Quadratic Programming Refinement
    Viet-Anh Le, Rahul Mangharam
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. On the Ω(n) SDP relaxation gap for Submodular Box-Constrained Quadratic Programming
    Junyu Zhang, Guanyi Wang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Reinforcement learning for constrained stochastic linear--quadratic control in continuous time
    Weiping Wu, Qitong Pan, Xun Li +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving
    Jiameng Lyu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{tiwari2026adaptive,
  title = {{Adaptive Variance-Reduced Stochastic Sequential (Quadratic Constrained) Quadratic Programming}},
  author = {Gopal Tiwari and Md Abu Talhamainuddin Ansary},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.18428},
  eprint = {2610.18428},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.18428},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Adaptive Variance-Reduced Stochastic Sequential (Quadratic Constrained) Quadratic Programming
AU  - Gopal Tiwari
AU  - Md Abu Talhamainuddin Ansary
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2610.18428
UR  - https://arxiv.org/abs/2610.18428
AB  - In this paper, we propose an adaptive variance-reduced stochastic sequential (quadratic constrained) quadratic programming (AVR-SS(QC)QP) method for nonlinear constrained optimization. The framework integrates SPIDER-based variance reduction, stochastic quasi-Newton curvature information, merit-function globalization, and adaptive switching between stochastic SQP and SQCQP models. The switching mechanism is governed by a relative constraint model curvature indicator that measures the second-order constraint information neglected by the linearized SQP model. A smoothed hysteresis rule ac?tivates the SQCQP model only when the relative constraint curvature is significant. An exact L1 merit function with Armijo backtracking globalizes the resulting directions, while a coupled stochastic Lyapunov analysis controls the interaction between gradient-estimation error and optimization progress. Under standard smoothness, sampling, regularity, and second-order conditions, we establish almost-sure consistency of the variance-reduced gradient estimator and global convergence of the KKT residual. We further show that, near regular KKT points, the curvature indicator vanishes and the method eventually selects the computationally cheaper SQP model. Numerical experiments on a sparse principal component analysis problem illustrate the practical be?havior of the proposed framework.
ER  -