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
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Natural gas production network infrastructure development under uncertainty, COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, Three ideas for a feasibility pump for nonconvex MINLP, Optimising lot sizing and order scheduling with non-linear production rates, Perspective Reformulation and Applications, Disjunctive Cuts for Nonconvex MINLP, Global Optimization of Mixed-Integer Signomial Programming Problems, Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, A general framework for convexity analysis in deterministic global optimization, Bound reduction using pairs of linear inequalities, Mixed integer nonlinear programming tools: an updated practical overview, Sufficient pruning conditions for MINLP in gas network design, Supply capacity acquisition and allocation with uncertain customer demands, Validation of nominations in gas network optimization: models, methods, and solutions, Alternative branching rules for some nonconvex problems, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, A computational study on QP problems with general linear constraints, The problems of non-convex quadratic programming related to phased antenna arrays optimization, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, Towards global parameter estimation exploiting reduced data sets, Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, A general purpose exact solution method for mixed integer concave minimization problems, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Cycle-based formulations in distance geometry, (Global) optimization: historical notes and recent developments, On the strength of recursive McCormick relaxations for binary polynomial optimization, The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems, Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models, Relaxations of factorable functions with convex-transformable intermediates, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Optimization of a complex flexible multibody systems with composite materials, Efficient interval partitioning-local search collaboration for constraint satisfaction, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, Global optimization in stabilizing controller design, Global optimization of explicit strong-stability-preserving Runge-Kutta methods, Global solution of non-convex quadratically constrained quadratic programs, Models and solution techniques for production planning problems with increasing byproducts, Multivariate McCormick relaxations, Global optimization of general nonconvex problems with intermediate polynomial substructures, A primal heuristic for optimizing the topology of gas networks based on dual information, A revised Taha's algorithm for polynomial 0-1 programming, Unnamed Item, Global optimization of general non-convex problems with intermediate bilinear substructures, Robust optimization of contaminant sensor placement for community water systems, The location-allocation problem of drone base stations, Tuning BARON using derivative-free optimization algorithms, A local relaxation approach for the siting of electrical substations, QPLIB: a library of quadratic programming instances, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Node selection strategies in interval branch and bound algorithms, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Global Solution of Bilevel Programming Problems, Reformulations in Mathematical Programming: Definitions and Systematics, An optimization method for solving mixed discrete-continuous programming problems, Molecular distance geometry methods: from continuous to discrete, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, Global optimization of semi-infinite programs via restriction of the right-hand side, On the Composition of Convex Envelopes for Quadrilinear Terms, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Global optimization of nonconvex problems with multilinear intermediates, The optimization test environment, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, 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
