BFO

swMATH36962MaRDI QIDQ52664

No author found.

Described by source

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

Related Items (13)

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 ⋮ Efficient unconstrained black box optimization ⋮ 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 ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ HyperNOMAD ⋮ Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications ⋮ A derivative-free optimization approach for the autotuning of a forex trading strategy ⋮ A method for convex black-box integer global optimization ⋮ Derivative-free optimization methods ⋮ Review and comparison of algorithms and software for mixed-integer derivative-free optimization

This page was built for software: BFO