arXiv (All)
open access
PDNQP: A GPU-based Factorization-free Method for Large-scale Nonconvex Quadratic Programming
Large-scale nonconvex quadratic programming remains challenging because the sparse matrix factorizations used by many existing solvers can incur substantial computational and memory costs and are difficult to parallelize efficiently on GPUs. We present PDNQP, a factorization-free first-order solver
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
- Neural Sparse Linear Solver Selection#239467
- Orthogonal JEPA: Factorized Predictive States for Latent World Models#471241
- Learning rate scheduling with matrix factorization for private training#334382
- Equivalence of Fixed-Rank and Rank-One Even-Order Symmetric Tensor Factorization#975044
- MENO: Memory-Efficient Neural Operator#1064283
Record · ID 1014149
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