A polyhedral branch-and-cut approach to global optimization

2005/05/03 by Mohit Tawarmalani, Nikolaos V. Sahinidis · 19 citations
Mathematics · Computer Science · Engineering · #Advanced Optimization Algorithms Research #Polynomial and algebraic computation #Advanced Control Systems Optimization

paper · doi:10.1007/s10107-005-0581-8

Citations

• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Cited by

• A bilevel decomposition method for the simultaneous heat integration and synthesis of steam/organic Rankine cycles
• Heat integration of intermittently available continuous streams in multipurpose batch plants
• Solving the Heilbronn Triangle Problem using Global Optimization Methods
• Optimal Vaccine Allocation for Pandemic Stabilization
• Eco-Coasting Strategies Using Road Grade Preview: Evaluation and Online Implementation Based on Mixed Integer Model Predictive Control
• Transfer Learning in Information Criteria-based Feature Selection
• Solving Heated Oil Pipeline Problems Via Mixed Integer Nonlinear Programming Approach
• Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
• Optimising heat exchanger network synthesis using convexity properties of the logarithmic mean temperature difference
• Interval Superposition Arithmetic
• Solving continuous and discrete nonlinear programs with BARON
• Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
• A Deterministic Global Optimization Method for Variational Inference
• Convex Hull of the Quadratic Branch AC Power Flow Equations and Its Application in Radial Distribution Networks
• Intersection cuts for factorable MINLP
• Optimal Trajectory Planning for Space Object Tracking with Collision-Avoidance Constraints
• Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming
• A General System for Heuristic Solution of Convex Problems over Nonconvex Sets
• Approximating the maximum of a polynomial over a polytope: Handelman decomposition and\n continuous generating functions