A polyhedral branch-and-cut approach to global optimization
From MaRDI portal
Publication:1780949
DOI10.1007/S10107-005-0581-8zbMATH Open1099.90047OpenAlexW2004407575MaRDI QIDQ1780949FDOQ1780949
Authors: Mohit Tawarmalani, Nikolaos V. Sahinidis 
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
Recommendations
- A hybrid LP/NLP paradigm for global optimization relaxations
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization of nonconvex problems with multilinear intermediates
- Convex Programming Methods for Global Optimization
- Global optimization of nonconvex problems with convex-transformable intermediates
Outer approximationConvexificationMixed-integer nonlinear programmingConvexity identificationFactorable programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Convex extensions and envelopes of lower semi-continuous functions
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- 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 nonlinear programming technique for the optimization of continuous processing systems
- The convergence rate of the sandwich algorithm for approximating convex functions
- Title not available (Why is that?)
- Asymptotic estimates for best and stepwise approximation of convex bodies II
- Approximation of smooth convex bodies by random circumscribed polytopes
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Discovering the Characteristics of Mathematical Programs via Sampling
Cited In (only showing first 100 items - show all)
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Non-convex nested Benders decomposition
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Reachability analysis and deterministic global optimization of DAE models
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Designing an optimal contract mechanism in a cellulosic biofuel enterprise
- Valid inequalities for the topology optimization problem in gas network design
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Optimized ellipse packings in regular polygons
- Conflict Analysis for MINLP
- A data-driven matching algorithm for ride pooling problem
- Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- On tightness and anchoring of McCormick and other relaxations
- Bi-objective design-for-control of water distribution networks with global bounds
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- Deterministic global optimization with Gaussian processes embedded
- Piecewise polyhedral formulations for a multilinear term
- On the numerical solution of the quadratic eigenvalue complementarity problem
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Optimization and validation of pumping system design and operation for water supply in high-rise buildings
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Discriminant analysis of distributional data via fractional programming
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
- Title not available (Why is that?)
- Nonconvex constrained optimization by a filtering branch and bound
- Solving generalized polynomial problem by using new affine relaxed technique
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
- Quantifying controllability in temporal networks with uncertainty
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Optimizing production capacity and safety stocks in general acyclic supply chains
- Partially distributed outer approximation
- Tuning BARON using derivative-free optimization algorithms
- A scalable global optimization algorithm for stochastic nonlinear programs
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- 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
- Global dynamic optimization with Hammerstein-Wiener models embedded
- Practical algorithms for multivariate rational approximation
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Discretization and global optimization for mixed integer bilinear programming
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- Robust arbitrage conditions for financial markets
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Polyhedral approximation in mixed-integer convex optimization
- Relaxations of factorable functions with convex-transformable intermediates
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- A general system for heuristic minimization of convex functions over non-convex sets
- Optimal deterministic algorithm generation
- Computing feasible points for binary MINLPs with MPECs
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Optimal control of water distribution networks without storage
- Tighter McCormick relaxations through subgradient propagation
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Medium-term power planning in electricity markets with pool and bilateral contracts
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Dual adaptive model predictive control
- A vector linear programming approach for certain global optimization problems
- Global optimization of nonconvex problems with convex-transformable intermediates
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- Global solution of non-convex quadratically constrained quadratic programs
- Packing convex polygons in minimum-perimeter convex hulls
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- EAGO.jl: easy advanced global optimization in Julia
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- A customized branch-and-bound approach for irregular shape nesting
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Convex reformulations for solving a nonlinear network design problem
- Adaptive constructive interval disjunction: algorithms and experiments
- 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
- A game-theoretic optimisation approach to fair customer allocation in oligopolies
- On the Weber facility location problem with limited distances and side constraints
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- An optimization-diversification approach to portfolio selection
Uses Software
This page was built for publication: A polyhedral branch-and-cut approach to global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780949)
