arXiv (All)
open access
Adaptive Variance-Reduced Stochastic Sequential (Quadratic Constrained) Quadratic Programming
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-func
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- PDNQP: A GPU-based Factorization-free Method for Large-scale Nonconvex Quadratic Programming#1014149
- $R$-Linear Convergence of Barzilai-Borwein Methods on Strictly Convex Quadratics via Closed-Cone Homogeneous Dynamics#1000071
- Learning When to Refine: Long-Horizon Reinforcement Learning for Budgeted Neural-Operator PDE Solvers#1215965
- Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning#440388
- Fitted Q-Evaluation without Bellman Completeness via Occupancy Weighting#797296
Record · ID 1343938
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive