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)
- 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
- An exact algorithm for a resource allocation problem in mobile wireless communications
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Title not available (Why is that?)
- Large-Scale Loan Portfolio Selection
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- An exact penalty global optimization approach for mixed-integer programming problems
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Maximizing the storage capacity of gas networks: a global MINLP approach
- Global optimization in Hilbert space
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- An exact semidefinite programming approach for the max-mean dispersion problem
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- A polynomial optimization approach to constant rebalanced portfolio selection
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Global optimization of semi-infinite programs via restriction of the right-hand side
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Optimized packing multidimensional hyperspheres: a unified approach
- Global optimization of nonconvex problems with multilinear intermediates
- Convex and concave relaxations of implicit functions
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- \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
- Node selection strategies in interval branch and bound algorithms
- A global MINLP approach to symbolic regression
- Oops! I cannot do it again: testing for recursive feasibility in MPC
- Title not available (Why is that?)
- All or nothing at all
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Target-oriented branch and bound method for global optimization
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Template polyhedra and bilinear optimization
- Improved convex and concave relaxations of composite bilinear forms
- Sufficient pruning conditions for MINLP in gas network design
- A new method for strong-weak linear bilevel programming problem
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- An improved test set approach to nonlinear integer problems with applications to engineering design
- On global optimization with indefinite quadratics
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- Extended formulations in mixed-integer convex programming
- A deterministic algorithm for global optimization
- A modified DIRECT algorithm with bilevel partition
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- On linear programming relaxations for solving polynomial programming problems
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization
- A cost minimization heuristic for the pooling problem
- Reverse propagation of McCormick relaxations
- Error bounds for monomial convexification in polynomial optimization
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)
