Branch-and-Model: a derivative-free global optimization algorithm
From MaRDI portal
Recommendations
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- Optimization algorithm based on densification and dynamic canonical descent
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Wedge trust region method for derivative free optimization.
- A derivative-free algorithm based on simple model for unconstrained optimization
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A hybrid LP/NLP paradigm for global optimization relaxations
- A locally-biased form of the DIRECT algorithm.
- A polyhedral branch-and-cut approach to global optimization
- A Simplex Method for Function Minimization
- A stochastic radial basis function method for the global optimization of expensive functions
- Algorithm 829
- Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
- An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- 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
- Efficient global optimization of expensive black-box functions
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Global optimization by multilevel coordinate search
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 653037 (Why is no real title available?)
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- scientific article; zbMATH DE number 1361578 (Why is no real title available?)
- Improved algorithms for convex minimization in relative scale
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Lipschitzian optimization without the Lipschitz constant
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- On global optimization using interval arithmetic
- On the Convergence of Pattern Search Algorithms
- On the design of optimization strategies based on global response surface approximation models
- On the Pareto optimality in the context of Lipschitzian optimization
- Response surface methodology. Process and product optimization using designed experiments
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- The DIRECT algorithm: 25 years later
- The global solver in the LINDO API
- The NEWUOA software for unconstrained optimization without derivatives
Cited in
(4)- Optimization algorithm based on densification and dynamic canonical descent
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- Solving continuous and discrete nonlinear programs with BARON
- Model-and-search: a derivative-free local optimization algorithm
This page was built for publication: Branch-and-Model: a derivative-free global optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097758)
