PreprintarXiv licencearXiv
A note on the convergence guarantees of RLT-based algorithms for polynomial optimization
Abstract
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 aware of this nuance may lead to the loss of convergence guarantees in RLT-based algorithms, especially if they rely on filtering strategies for the construction of the bound-factor constraints.
Related
- Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
- From Consensus-Based Optimization to Particle Swarm Optimization: Convergence Guarantees under Drift-Diffusion Coupling
- Differentially Private Distributed Optimization via the Intrinsic Randomness of Zeroth-Order Estimators: Sampling Geometry, Convergence, and Privacy Guarantees
- Operator Calculus for Population-Based Optimization: Modular Convergence and Finite-Population Guarantees
- Stochastic Augmented Lagrangian Framework with Second-Order Convergence Guarantees for Nonconvex Expectation-Constrained Optimization
BibTeX
@misc{barrosgonzalez2026note,
title = {{A note on the convergence guarantees of RLT-based algorithms for polynomial optimization}},
author = {Alejandro Barros-González and Julio González-Díaz and Brais González-Rodríguez and Iria Rodríguez Acevedo},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.21483},
eprint = {2606.21483},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.21483},
}
RIS
TY - UNPB
TI - A note on the convergence guarantees of RLT-based algorithms for polynomial optimization
AU - Alejandro Barros-González
AU - Julio González-Díaz
AU - Brais González-Rodríguez
AU - Iria Rodríguez Acevedo
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2606.21483
UR - https://arxiv.org/abs/2606.21483
AB - 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 aware of this nuance may lead to the loss of convergence guarantees in RLT-based algorithms, especially if they rely on filtering strategies for the construction of the bound-factor constraints.
ER -