BFO

swMATH36962MaRDI QIDQ52664FDOQ52664

Author name not available (Why is that?)

Described by source

• BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables

Cited In (13)

• A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization
• On reconstruction of binary images by efficient sample-based parameterization in applications for electrical impedance tomography
• A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization
• Derivative-free methods for mixed-integer nonsmooth constrained optimization
• A derivative-free optimization approach for the autotuning of a forex trading strategy
• Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
• HyperNOMAD
• A method for convex black-box integer global optimization
• The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
• Efficient unconstrained black box optimization
• Derivative-free optimization methods

This page was built for software: BFO