A probing algorithm for MINLP with failure prediction by SVM

DOI10.1007/978-3-642-21311-3_15MaRDI QIDQ3003284zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(5)

• Inexact solution of NLP subproblems in MINLP
• Theoretical challenges towards cutting-plane selection
• Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
• Domain reduction techniques for global NLP and MINLP optimization
• Three enhancements for optimization-based bound tightening

Describes a project that uses

Uses Software

• COCONUT
• Couenne

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)