A polyhedral branch-and-cut approach to global optimization

From MaRDI portal
Publication:1780949

DOI10.1007/s10107-005-0581-8zbMath1099.90047OpenAlexW2004407575MaRDI QIDQ1780949

Nikolaos V. Sahinidis, Mohit Tawarmalani

Publication date: 14 June 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0581-8

zbMATH Keywords

Outer approximationConvexificationMixed-integer nonlinear programmingConvexity identificationFactorable programming


Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)


Related Items

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS, EAGO.jl: easy advanced global optimization in Julia, Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach, On the numerical solution of the quadratic eigenvalue complementarity problem, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems, Multi-fidelity algorithms for the horizontal alignment problem in road design, An Algorithm for Maximizing a Convex Function Based on Its Minimum, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Solving generalized polynomial problem by using new affine relaxed technique, Extended Formulations in Mixed-Integer Convex Programming, Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C, A Deterministic Algorithm for Global Optimization, Simultaneous Location of Trauma Centers and Helicopters for Emergency Medical Service Planning, Tractable Relaxations of Composite Functions, Piecewise polyhedral formulations for a multilinear term, Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded, Optimizing production capacity and safety stocks in general acyclic supply chains, Solving binary-constrained mixed complementarity problems using continuous reformulations, Validation of nominations in gas network optimization: models, methods, and solutions, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Alternative branching rules for some nonconvex problems, Convex and concave relaxations of implicit functions, A data-driven matching algorithm for ride pooling problem, A generic interval branch and bound algorithm for parameter estimation, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, A distributionally ambiguous two-stage stochastic approach for investment in renewable generation, Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems, Towards global parameter estimation exploiting reduced data sets, Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization, Packing convex polygons in minimum-perimeter convex hulls, Sparse convex optimization toolkit: a mixed-integer framework, Branch-and-Model: a derivative-free global optimization algorithm, Strong SOCP Relaxations for the Optimal Power Flow Problem, Large-Scale Loan Portfolio Selection, Unnamed Item, A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, Practical algorithms for multivariate rational approximation, Proportional packing of circles in a circular container, Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings, Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization, An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, Improved convex and concave relaxations of composite bilinear forms, Maximum entropy approach for solving pessimistic bilevel programming problems, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods, On the Weber facility location problem with limited distances and side constraints, Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program, On convex envelopes for bivariate functions over polytopes, Relaxations of factorable functions with convex-transformable intermediates, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, A general system for heuristic minimization of convex functions over non-convex sets, Global optimization in stabilizing controller design, Global solution of non-convex quadratically constrained quadratic programs, Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Global optimization of general non-convex problems with intermediate bilinear substructures, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Reachability Analysis and Deterministic Global Optimization of DAE Models, nlopt, Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment, Node selection strategies in interval branch and bound algorithms, Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application, A new method for strong-weak linear bilevel programming problem, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming, Lower level duality and the global solution of generalized semi-infinite programs, Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes, Piecewise Linear Function Fitting via Mixed-Integer Linear Programming, On the Derivation of Continuous Piecewise Linear Approximating Functions, Tax-Aware Dynamic Asset Allocation, Global optimization of semi-infinite programs via restriction of the right-hand side, High-Performance Prototyping of Decomposition Methods in GAMS, Conflict Analysis for MINLP, MPEC Methods for Bilevel Optimization Problems, Minimizing the sum of many rational functions, Global solutions to a class of CEC benchmark constrained optimization problems, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, 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, Dynamic coupling of photoacclimation and photoinhibition in a model of microalgae growth, A review of recent advances in global optimization, Conic mixed-integer rounding cuts, Mathematical programming techniques in water network optimization, A MILP formulation for generalized geometric programming using piecewise-linear approximations, National-strategic investment in European power transmission capacity, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A model for clustering data from heterogeneous dissimilarities, Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?, A global MINLP approach to symbolic regression, Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On the product knapsack problem, Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction, Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution, On linear programming relaxations for solving polynomial programming problems, GLOMIQO: global mixed-integer quadratic optimizer, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Global optimization of MIQCPs with dynamic piecewise relaxations, An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems, 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, Global optimization algorithm for capacitated multi-facility continuous location-allocation problems, Optimal deterministic algorithm generation, A customized branch-and-bound approach for irregular shape nesting, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, Equal risk bounding is better than risk parity for portfolio selection, Guided dive for the spatial branch-and-bound, Some results on the strength of relaxations of multilinear functions, Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality, Decomposition strategy for the stochastic pooling problem, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy, An improved test set approach to nonlinear integer problems with applications to engineering design, Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets, Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations, A framework for globally optimizing mixed-integer signomial programs, An exact algorithm for a resource allocation problem in mobile wireless communications, Extended formulations in mixed integer conic quadratic programming, Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints, Explicit hybrid model-predictive control: the exact solution, Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation, Convex reformulations for solving a nonlinear network design problem, Lift-and-project cuts for convex mixed integer nonlinear programs, Adaptive constructive interval disjunction: algorithms and experiments, Domain reduction techniques for global NLP and MINLP optimization, Reduced RLT representations for nonconvex polynomial programming problems, Packing congruent hyperspheres into a hypersphere, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, On global optimization with indefinite quadratics, Oops! I cannot do it again: testing for recursive feasibility in MPC, Global optimization in Hilbert space, Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs, Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control, Convergence rate of McCormick relaxations, Bound constrained interval global optimization in the COCONUT environment, Deterministic global optimization with artificial neural networks embedded, A modified DIRECT algorithm with bilevel partition, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Robust bilateral trade with discrete types, Upper bounding in inner regions for global optimization under inequality constraints, Extended formulations for convex envelopes, Global optimization of generalized semi-infinite programs via restriction of the right hand side, A cost minimization heuristic for the pooling problem, Reverse propagation of McCormick relaxations, Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem, Computing feasible points for binary MINLPs with MPECs, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Network expansion to mitigate market power, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming, Medium-term power planning in electricity markets with pool and bilateral contracts, Three enhancements for optimization-based bound tightening, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Convergence analysis of multivariate McCormick relaxations, Global optimization of nonconvex problems with convex-transformable intermediates, Decomposition-based inner- and outer-refinement algorithms for global optimization, A vector linear programming approach for certain global optimization problems, Computational optimization of gas compressor stations: MINLP models versus continuous reformulations, A polynomial optimization approach to constant rebalanced portfolio selection, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers, Reformulations for utilizing separability when solving convex MINLP problems, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, All or nothing at all, Polyhedral approximation in mixed-integer convex optimization, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, Approximated perspective relaxations: a project and lift approach, Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Designing an optimal contract mechanism in a cellulosic biofuel enterprise, Integration of expert knowledge into radial basis function surrogate models, Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, On decomposition and multiobjective-based column and disjunctive cut generation for MINLP, Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems, Bi-objective design-for-control of water distribution networks with global bounds, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, Optimization and validation of pumping system design and operation for water supply in high-rise buildings, Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures, Obey validity limits of data-driven models through topological data analysis and one-class classification, A bilevel optimization approach to decide the feasibility of bookings in the European gas market, Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives, Derivative-free optimization: a review of algorithms and comparison of software implementations, The supporting hyperplane optimization toolkit for convex MINLP, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Sufficient pruning conditions for MINLP in gas network design, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Dual adaptive model predictive control, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, How to solve a design centering problem, An exact semidefinite programming approach for the max-mean dispersion problem, Mathematical models to improve the current practice in a home healthcare unit, SUSPECT: MINLP special structure detector for Pyomo, Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Error bounds for monomial convexification in polynomial optimization, SDP-based branch-and-bound for non-convex quadratic integer optimization, A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms, An efficient compact quadratic convex reformulation for general integer quadratic programs, An exact penalty global optimization approach for mixed-integer programming problems, On the impact of running intersection inequalities for globally solving polynomial optimization problems, Outer-product-free sets for polynomial optimization and oracle-based cuts, Convex envelopes generated from finitely many compact convex sets, The impact of potential-based physics models on pricing in energy networks, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, A deterministic approach to global box-constrained optimization, Explicit convex and concave envelopes through polyhedral subdivisions, A review of deterministic optimization methods in engineering and management, On convex relaxations of quadrilinear terms, A game-theoretic optimisation approach to fair customer allocation in oligopolies, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, Optimized packing multidimensional hyperspheres: a unified approach, A new framework to relax composite functions in nonlinear programs, Robust arbitrage conditions for financial markets, Improved componentwise verified error bounds for least squares problems and underdetermined linear systems, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Multivariate McCormick relaxations, Global optimization of general nonconvex problems with intermediate polynomial substructures, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, On valid inequalities for mixed integer \(p\)-order cone programming, A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems, A primal heuristic for optimizing the topology of gas networks based on dual information, Tighter McCormick relaxations through subgradient propagation, Valid inequalities for the topology optimization problem in gas network design, Convergent upper bounds in global minimization with nonlinear equality constraints, Penalized semidefinite programming for quadratically-constrained quadratic optimization, The exact solution of multiparametric quadratically constrained quadratic programming problems, Tuning BARON using derivative-free optimization algorithms, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, On tightness and anchoring of McCormick and other relaxations, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, A scalable global optimization algorithm for stochastic nonlinear programs, QPLIB: a library of quadratic programming instances, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Discriminant analysis of distributional data via fractional programming, Nonconvex constrained optimization by a filtering branch and bound, Complementarity-based nonlinear programming techniques for optimal mixing in gas networks, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, On tackling reverse convex constraints for non-overlapping of unequal circles, Quantifying controllability in temporal networks with uncertainty, Partially distributed outer approximation, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization, An optimization-diversification approach to portfolio selection, Optimal control of water distribution networks without storage, DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems, Deterministic global optimization with Gaussian processes embedded, Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization, Template polyhedra and bilinear optimization, Global dynamic optimization with Hammerstein-Wiener models embedded, A choice-based optimization approach for contracting in supply chains, Optimized ellipse packings in regular polygons, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization, A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks, An adaptive discretization algorithm for the design of water usage and treatment networks, Maximizing the storage capacity of gas networks: a global MINLP approach, Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP, Discretization and global optimization for mixed integer bilinear programming, A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, Sparse regression at scale: branch-and-bound rooted in first-order optimization, Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations, Non-convex nested Benders decomposition, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, Univariate parameterization for global optimization of mixed-integer polynomial problems, Global optimization of nonconvex problems with multilinear intermediates, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production


Uses Software


Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1780949&oldid=14130449"
Powered by MediaWiki