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
Outer approximationConvexificationMixed-integer nonlinear programmingConvexity identificationFactorable programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (only showing first 100 items - show all)
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
Uses Software
Cites Work
- Unnamed Item
- The convergence rate of the sandwich algorithm for approximating convex functions
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Convex extensions and envelopes of lower semi-continuous functions
- Approximation of smooth convex bodies by random circumscribed polytopes
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Discovering the Characteristics of Mathematical Programs via Sampling
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: A polyhedral branch-and-cut approach to global optimization
