Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Strengthening SONC Relaxations with Constraints Derived from Variable Bounds

  • Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials certificates, which are well suited for sparse problems since the computational cost depends only on the number of terms in the polynomials and does not depend on the degrees of the polynomials. This work is a first step to integrating SONC-based relaxations of polynomial problems into a branch-and-bound algorithm. To this end, the SONC relaxation for constrained optimization problems is extended in order to better utilize variable bounds, since this property is key for the success of a relaxation in the context of branch-and-bound. Computational experiments show that the proposed extension is crucial for making the SONC relaxations applicable to most constrained polynomial optimization problems and for integrating the two approaches.
Author:Ksenia BestuzhevaORCiD, Ambros GleixnerORCiD, Helena Völker
Document Type:In Proceedings
Parent Title (English):Proceedings of the Hungarian Global Optimization Workshop HUGO 2022
First Page:41
Last Page:44
Year of first publication:2022
ArXiv Id:http://arxiv.org/abs/2211.05518
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.