Derivative-free optimization involves the methods used to minimize an expensive objective functionwhen its derivatives are not available. We present here a trust-region algorithmbased on Radial Basis Functions (RBFs). The main originality of our approach is the use of RBFs to build the trust-region models and our management of the interpolation points based on Newton fundamental polynomials. Moreover the complexity of ourmethod is very attractive. We have tested the algorithmagainst the best state-of-theart methods (UOBYQA, NEWUOA, DFO). The tests on the problems from the CUTEr collection show that BOOSTERS is performing very well on medium-size problems. Moreover, it is able to solve problems of dimension 200, which is considered very larg...
Derivative free optimization algorithms are implementations of trust region based derivative-free me...
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this article we present an algorithm for solving bound constrained optimization problems without ...
We have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative...
This thesis concerns the development and analysis of derivative-free optimization algorithms for sim...
In this survey article we give the basic description of the interpolation based derivative free opti...
In this paper, we investigate two ideas in the context of the interpolation-based optimization parad...
In this paper, we investigate two ideas in the context of the interpolation-based optimization parad...
In this paper we address the global optimization of functions subject to bound and linear constraint...
Optimization problems with different levels arise by discretization of ordinary and partial differen...
In this paper we study the minimization of a nonsmooth black-box type function, without assuming any...
Abstract: In this paper we address the global optimization of functions subject to bound and linear ...
A structured version of derivative-free random pattern search optimization algorithms is introduced,...
A structured version of derivative-free random pattern search optimization algorithms is introduced,...
We introduce MNH, a new algorithm for unconstrained optimization when derivatives are unavailable, p...
Derivative free optimization algorithms are implementations of trust region based derivative-free me...
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this article we present an algorithm for solving bound constrained optimization problems without ...
We have developed a new derivative-free algorithm based on Radial Basis Functions (RBFs). Derivative...
This thesis concerns the development and analysis of derivative-free optimization algorithms for sim...
In this survey article we give the basic description of the interpolation based derivative free opti...
In this paper, we investigate two ideas in the context of the interpolation-based optimization parad...
In this paper, we investigate two ideas in the context of the interpolation-based optimization parad...
In this paper we address the global optimization of functions subject to bound and linear constraint...
Optimization problems with different levels arise by discretization of ordinary and partial differen...
In this paper we study the minimization of a nonsmooth black-box type function, without assuming any...
Abstract: In this paper we address the global optimization of functions subject to bound and linear ...
A structured version of derivative-free random pattern search optimization algorithms is introduced,...
A structured version of derivative-free random pattern search optimization algorithms is introduced,...
We introduce MNH, a new algorithm for unconstrained optimization when derivatives are unavailable, p...
Derivative free optimization algorithms are implementations of trust region based derivative-free me...
In this article we present an algorithm for solving bound constrained optimization problems without ...
In this article we present an algorithm for solving bound constrained optimization problems without ...