arXiv (All)
open access
Anytime-Feasible First-Order Optimization via Safe Sequential QCQP
This paper presents the Safe Sequential Quadratically Constrained Quadratic Programming (SS-QCQP) algorithm, a first-order method for smooth inequality-constrained nonconvex optimization that guarantees feasibility at every iteration. The method is derived from a continuous-time dynamical system who
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
- Alternative Hamiltonian and Lagrangian Approaches for Constrained Systems#1200343
- HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization#1155166
- An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory.#136047
- Vehicle-Routing Clustering by Sparse Quantum Relaxation#1014166
- How Sequential Algorithm Portfolios can benefit Black Box Optimization#987569
Record · ID 1233742
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