Branching and bounds tighteningtechniques for non-convex MINLP
From MaRDI portal
Publication:3396388
DOI10.1080/10556780903087124zbMath1179.90237OpenAlexW2001741445MaRDI QIDQ3396388
Margot, François, Leo Liberti, Pietro Belotti, Jon Lee, Andreas Wächter
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903087124
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (only showing first 100 items - show all)
A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ Mathematical programming techniques in water network optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ A global MINLP approach to symbolic regression ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming ⋮ Relaxations and heuristics for the multiple non-linear separable knapsack problem ⋮ RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems ⋮ On the product knapsack problem ⋮ A non-parametric approach to demand forecasting in revenue management ⋮ Divisive heuristic for modularity density maximization ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ Convergence analysis of Taylor models and McCormick-Taylor models ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ A computational study of global optimization solvers on two trust region subproblems ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ Guided dive for the spatial branch-and-bound ⋮ A recipe for finding good solutions to MINLPs ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Some results on the strength of relaxations of multilinear functions ⋮ A storm of feasibility pumps for nonconvex MINLP ⋮ The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ On interval-subgradient and no-good cuts ⋮ Virtuous smoothing for global optimization ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ Mathematical programming: Turing completeness and applications to software analysis ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Algorithms for generalized potential games with mixed-integer variables ⋮ Inexact solution of NLP subproblems in MINLP ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Reduced RLT representations for nonconvex polynomial programming problems ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ Combinatorial integral approximation ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ An integer linear programming approach for bilinear integer programming ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ Fitting piecewise linear continuous functions ⋮ On global optimization with indefinite quadratics ⋮ On convex relaxations of quadrilinear terms ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations ⋮ Ball-and-finger system: modeling and optimal trajectories ⋮ Energy-optimal multi-goal motion planning for planar robot manipulators ⋮ Convergence rate of McCormick relaxations ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ Extended formulations for convex envelopes ⋮ A reliable affine relaxation method for global optimization ⋮ Reverse propagation of McCormick relaxations ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Safe autonomy under perception uncertainty using chance-constrained temporal logic ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions ⋮ Computing equilibria of Cournot oligopoly models with mixed-integer quantities ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Mixed-integer linear programming heuristics for the prepack optimization problem ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes ⋮ Three enhancements for optimization-based bound tightening ⋮ Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization ⋮ On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ Decomposition-based inner- and outer-refinement algorithms for global optimization ⋮ Rounding-based heuristics for nonconvex MINLPS ⋮ Globally solving nonconvex quadratic programming problems via completely positive programming ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ Experimental validation of volume-based comparison for double-McCormick relaxations ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ Feasibility pump for aircraft deconfliction with speed regulation ⋮ Preprocessing and cutting planes with conflict graphs ⋮ MINLP formulations for continuous piecewise linear function fitting ⋮ Orbital shrinking: theory and applications ⋮ Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ On tackling reverse convex constraints for non-overlapping of unequal circles ⋮ Convex hull representations for bounded products of variables ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems ⋮ RENS. The optimal rounding ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Polynomial programming prevents aircraft (and other) conflicts ⋮ Output feedback design for discrete-time constrained systems subject to persistent disturbances via bilinear programming ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ A choice-based optimization approach for contracting in supply chains ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Tight bounds on the maximal perimeter and the maximal width of convex small polygons ⋮ AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization ⋮ Non-convex nested Benders decomposition ⋮ Empirical performance bounds for quantum approximate optimization ⋮ Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
Uses Software
This page was built for publication: Branching and bounds tighteningtechniques for non-convex MINLP
