Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Three enhancements for optimization-based bound tightening
- Bound reduction using pairs of linear inequalities
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Feasibility-based bounds tightening via fixed points
- Branching and bounds tighteningtechniques for non-convex MINLP
Cited in
(10)- Domain reduction techniques for global NLP and MINLP optimization
- Bound reduction using pairs of linear inequalities
- Tight convex relaxations for the expansion planning problem
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A probing algorithm for MINLP with failure prediction by SVM
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Three enhancements for optimization-based bound tightening
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
This page was built for publication: Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922925)
