A reduced space branch and bound algorithm for global optimization.
From MaRDI portal
Publication:1368739
DOI10.1023/A:1008212418949zbMath1040.90567OpenAlexW2032479603MaRDI QIDQ1368739
Efstratios N. Pistikopoulos, Thomas G. W. Epperly
Publication date: 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008212418949
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items (17)
Obey validity limits of data-driven models through topological data analysis and one-class classification ⋮ A general framework for convexity analysis in deterministic global optimization ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Convex and concave relaxations of implicit functions ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ Decision-dependent probabilities in stochastic programs with recourse ⋮ Comparison of deterministic and stochastic approaches to global optimization ⋮ A reduced-space line-search method for unconstrained optimization via random descent directions ⋮ Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces ⋮ A scalable global optimization algorithm for stochastic nonlinear programs ⋮ Deterministic global optimization with Gaussian processes embedded ⋮ Linearity embedded in nonconvex programs
Uses Software
This page was built for publication: A reduced space branch and bound algorithm for global optimization.