arXiv (All)
open access
A One-Factorization Predictor-Corrector Long-Step Arc-Search Method and a Curvature-Amplified Variant for Semidefinite Programming with a Homogeneous Self-Dual Embedding
In a predictor-corrector arc-search method, a point on the predictor arc is first selected and a corrector is then computed at that point. Since the Karush-Kuhn-Tucker (KKT) matrix changes with the selected point, this correction may require a second factorization in each iteration. We propose a one
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
- ANaLOG: Anisotropic Native-Latent Operator Guidance for Solving Inverse Problems#1115889
- PDNQP: A GPU-based Factorization-free Method for Large-scale Nonconvex Quadratic Programming#1014149
- Control-Geometry Straightening for Sampling-Based Latent Planning#1130257
- Control-Geometry Straightening for Sampling-Based Latent Planning#1108773
- Orthogonal JEPA: Factorized Predictive States for Latent World Models#471241
Record · ID 1119348
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