Branch-and-Model: a derivative-free global optimization algorithm

DOI10.1007/s10589-023-00466-3zbMath1519.90264OpenAlexW4362473350MaRDI QIDQ6097758

Nikolaos V. Sahinidis, Sreekanth Rajagopalan, Kaiwen Ma, Atharv Bhosekar, Luis Miguel Rios

Publication date: 7 June 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-023-00466-3

zbMATH Keywords

derivative-free optimizationglobal searchblack-box optimizationsurrogate modeling

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gradient methods for minimizing composite functions
• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
• On the design of optimization strategies based on global response surface approximation models
• An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
• On global optimization using interval arithmetic
• Efficient global optimization of expensive black-box functions
• Global optimization by multilevel coordinate search
• Lipschitzian optimization without the Lipschitz constant
• A hybrid LP/NLP paradigm for global optimization relaxations
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
• A polyhedral branch-and-cut approach to global optimization
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
• The DIRECT algorithm: 25 years later
• Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization
• MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
• Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Improved Algorithms for Convex Minimization in Relative Scale
• On the Convergence of Pattern Search Algorithms
• The global solver in the LINDO API
• An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
• Benchmarking Derivative-Free Optimization Algorithms
• Algorithm 829
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• A Simplex Method for Function Minimization
• Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
• A locally-biased form of the DIRECT algorithm.