Impact of domain reduction techniques in polynomial optimization: a computational study

DOI10.1007/S11750-025-00703-4MaRDI QIDQ6834988zbMATH OpenFDO

Authors Brais González-Rodríguez, Julio González-Díaz, Pablo Rodríguez-Fernández

Publication date 31 March 2026

Published in Top (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11750-025-00703-4

zbMATH Keywords

domain reductionglobal optimizationmachine learningpolynomial optimizationreformulation-linearization technique

Mathematics Subject Classification ID

Polynomial optimization (90C23) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A branch-and-reduce approach to global optimization
• A Computational Study of Search Strategies for Mixed Integer Programming
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Bound reduction using pairs of linear inequalities
• Branching and bounds tighteningtechniques for non-convex MINLP
• Branching rules revisited
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver
• Domain reduction techniques for global NLP and MINLP optimization
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
• Exact conic programming relaxations for a class of convex polynomial cone programs
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Global optimization with polynomials and the problem of moments
• Global solution of non-convex quadratically constrained quadratic programs
• Learning for Spatial Branching: An Algorithm Selection Approach
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• Moment and Polynomial Optimization
• On learning and branching: a survey
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
• QPLIB: a library of quadratic programming instances
• Quantile regression forests
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Solving Quadratic Programming by Cutting Planes
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
• Three enhancements for optimization-based bound tightening

This page was built for publication: Impact of domain reduction techniques in polynomial optimization: a computational study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834988)