MOBOpt — multi-objective Bayesian optimization | Zendy

Paulo Paneque Galuzio | Zendy; Emerson Hochsteiner de Vasconcelos Segundo | Zendy; Leandro dos Santos Coelho | Zendy; Viviana Cocco Mariani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MOBOpt — multi-objective Bayesian optimization

Author(s) -

Paulo Paneque Galuzio,

Emerson Hochsteiner de Vasconcelos Segundo,

Leandro dos Santos Coelho,

Viviana Cocco Mariani

Publication year - 2020

Publication title -

softwarex

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.528

H-Index - 21

ISSN - 2352-7110

DOI - 10.1016/j.softx.2020.100520

Subject(s) - bayesian optimization , python (programming language) , computer science , multi objective optimization , mathematical optimization , benchmark (surveying) , pareto principle , software , bayesian probability , class (philosophy) , optimization problem , algorithm , machine learning , artificial intelligence , mathematics , programming language , geodesy , geography

This work presents a new software, programmed as a Python class, that implements a multi-objective Bayesian optimization algorithm. The proposed method is able to calculate the Pareto front approximation of optimization problems with fewer objective functions evaluations than other methods, which makes it appropriate for costly objectives. The software was extensively tested on benchmark functions for optimization, and it was able to obtain Pareto Function approximations for the benchmarks with as many as 20 objective function evaluations, those results were obtained for problems with different dimensionalities and constraints.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research