Intersection cuts for polynomial optimization

DOI10.1007/978-3-030-17953-3_6MaRDI QIDQ2293083zbMATH OpenOpenAlexFDO

Authors Chen Chen, Gonzalo Muñoz, Daniel Bienstock

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17953-3_6

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Polynomial optimization (90C23)

Recommendations

• Outer-product-free sets for polynomial optimization and oracle-based cuts
• On the implementation and strengthening of intersection cuts for QCQPs
• On the implementation and strengthening of intersection cuts for QCQPs
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Generalized intersection cuts and a new cut generating paradigm

Cited in

(11)

• Maximal quadratic-free sets
• Maximal quadratic-free sets
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• Cutting plane generation through sparse principal component analysis
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• On the implementation and strengthening of intersection cuts for QCQPs
• Partial hyperplane activation for generalized intersection cuts
• On the implementation and strengthening of intersection cuts for QCQPs
• Generalized Cut Method for Computing Szeged–Like Polynomials with Applications to Polyphenyls and Carbon Nanocones
• Towards a characterization of maximal quadratic-free sets

This page was built for publication: Intersection cuts for polynomial optimization

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