Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
From MaRDI portal
Publication:1881050
DOI10.1007/S10107-003-0467-6zbMath1062.90041OpenAlexW2084006722MaRDI QIDQ1881050
Nikolaos V. Sahinidis, Mohit Tawarmalani
Publication date: 27 September 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0467-6
Related Items (only showing first 100 items - show all)
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Maximum feasible subsystems of distance geometry constraints ⋮ Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections ⋮ Extended reverse-convex programming: an approximate enumeration approach to global optimization ⋮ Theoretical and computational results about optimality-based domain reductions ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ A review of recent advances in global optimization ⋮ Conic mixed-integer rounding cuts ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms ⋮ On linear programming relaxations for solving polynomial programming problems ⋮ Convergence analysis of Taylor models and McCormick-Taylor models ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ 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 ⋮ Optimization methods for pipeline transportation of natural gas with variable specific gravity and compressibility ⋮ A recipe for finding good solutions to MINLPs ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ Deterministic global derivative-free optimization of black-box problems with bounded Hessian ⋮ Optimality-based domain reduction for inequality-constrained NLP and MINLP problems ⋮ A mean-risk mixed integer nonlinear program for transportation network protection ⋮ On interval-subgradient and no-good cuts ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ On the optimal design of water distribution networks: a practical MINLP approach ⋮ A numerical study of diagonally split Runge-Kutta methods for PDEs with discontinuities ⋮ High order strong stability preserving time discretizations ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints ⋮ Distance geometry and data science ⋮ On the impact of running intersection inequalities for globally solving polynomial optimization problems ⋮ Inexact solution of NLP subproblems in MINLP ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ Copositive optimization -- recent developments and applications ⋮ Convex reformulations for solving a nonlinear network design problem ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ A review of deterministic optimization methods in engineering and management ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Portfolio optimization for wealth-dependent risk preferences ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ Rigorous filtering using linear relaxations ⋮ On convex relaxations of quadrilinear terms ⋮ Global optimization problems and domain reduction strategies ⋮ Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs ⋮ Modern tools for the time-discrete dynamics and optimization of gene-environment networks ⋮ Convergence rate of McCormick relaxations ⋮ A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures ⋮ Extending the QCR method to general mixed-integer programs ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ Extended formulations for convex envelopes ⋮ Lago: a (heuristic) branch and cut algorithm for nonconvex minlps ⋮ A new framework to relax composite functions in nonlinear programs ⋮ A reliable affine relaxation method for global optimization ⋮ Reverse propagation of McCormick relaxations ⋮ Computing feasible points for binary MINLPs with MPECs ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ An algorithmic framework for convex mixed integer nonlinear programs ⋮ Efficient interval partitioning for constrained global optimization ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Differentiable McCormick relaxations ⋮ Three enhancements for optimization-based bound tightening ⋮ The demand weighted vehicle routing problem ⋮ Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ Parametric mixed-integer 0-1 linear programming: The general case for a single parameter ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Global optimization of nonconvex problems with convex-transformable intermediates ⋮ Computational optimization of gas compressor stations: MINLP models versus continuous reformulations ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ Rounding-based heuristics for nonconvex MINLPS ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ Valid inequalities for the topology optimization problem in gas network design ⋮ An exact solution method for reliability optimization in complex systems ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ Performance safety enforcement in strongly connected timed event graphs ⋮ A polyhedral branch-and-cut approach to global optimization ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ A comparison of complete global optimization solvers ⋮ \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers ⋮ Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems ⋮ New methods for calculating \(\alpha\)BB-type underestimators ⋮ RENS. The optimal rounding ⋮ Convex mixed integer nonlinear programming problems and an outer approximation algorithm ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ A multi-objective and multi-period optimization model for urban healthcare waste's reverse logistics network design ⋮ Editorial: Reformulation techniques in mathematical programming ⋮ A global continuation algorithm for solving binary quadratic programming problems ⋮ Mixed integer nonlinear programming tools: a practical overview ⋮ Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs ⋮ A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
Uses Software
This page was built for publication: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
