arXiv (All)
open access
A note on the convergence guarantees of RLT-based algorithms for polynomial optimization
This paper identifies and addresses a mathematical oversight in one of the foundational results on the Reformulation-Linearization Technique (RLT) for polynomial optimization. Correctness of the original result can be easily recovered by adding a minor and natural assumption. However, not being awar
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
- Potential-reduction methods in mathematical programming#429966
- Concave Roofs and Downward Recovery for DR-Submodular Polynomial Maximization#1199301
- A priori error estimates for a Hybrid High-Order method on variable-exponent Leray-Lions problems#1356947
- Computational Simulation and Algorithm Analysis for Solving Combinatorial Optimization Problems in Graph Theory and Discrete Mathematics#246976
- An Evaluation of Vertex Elimination Strategies for Algorithmic Differentiation#1324517
Record · ID 1202117
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