A probing algorithm for MINLP with failure prediction by SVM

DOI10.1007/978-3-642-21311-3_15zbMATH Open1302.90160OpenAlexW1510953666MaRDI QIDQ3003284FDOQ3003284

Authors: Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter 

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_15

Recommendations

• Three enhancements for optimization-based bound tightening
• Branching and bounds tighteningtechniques for non-convex MINLP
• Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
• On branching rules for convex mixed-integer nonlinear optimization
• Feasibility-based bounds tightening via fixed points

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)

Cited In (4)

• Theoretical challenges towards cutting-plane selection
• Domain reduction techniques for global NLP and MINLP optimization
• Inexact solution of NLP subproblems in MINLP
• Three enhancements for optimization-based bound tightening

Uses Software

• Couenne
• COCONUT

This page was built for publication: A probing algorithm for MINLP with failure prediction by SVM

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