BFO, a trainable derivative-free Brute Force Optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables

Margherita Porcelli, Philippe Toint

Research output: Contribution to journalArticlepeer-review

13 Downloads (Pure)

Abstract

A direct-search derivative-free Matlab optimizer for bound-constrained problems is described, whose remarkable features are its ability to handle a mix of continuous and discrete variables, a versatile interface as well as a novel self-training option. Its performance compares favorably with that of NOMAD (Nonsmooth Optimization by Mesh Adaptive Direct Search), a well-known derivative-free optimization package. It is also applicable to multilevel equilibrium- or constrained-type problems. Its easy-to-use interface provides a number of user-oriented features, such as checkpointing and restart, variable scaling, and early termination tools.

Original languageEnglish
Article number6
Number of pages28
JournalTransactions of the American Methematical Society on Mathematical Software
Volume44
Issue number1
DOIs
Publication statusPublished - 30 Jun 2017

Keywords

  • derivative-free optimization
  • trainable algorithms
  • bound constraints
  • mixed integer optimization
  • direct-search methods
  • Bound constraints
  • Direct-search methods
  • Derivative-free optimization
  • Mixed-integer optimization
  • Trainable algorithms

Fingerprint

Dive into the research topics of 'BFO, a trainable derivative-free Brute Force Optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables'. Together they form a unique fingerprint.

Cite this