AbstractA new algorithm for full global optimization of a Lipschitzian function over an arbitrary bounded set in Rn is presented. A procedure is proposed to handle functions with unknown Lip constants. Application to the cubic algorithm is given and illustrative examples are presented
A well-known example of global optimization that provides solutions within fixed error limits is opt...
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function m...
This work addresses the sequential optimization of an unknown and potentially nonconvex function ove...
AbstractA new algorithm for full global optimization of a Lipschitzian function over an arbitrary bo...
AbstractA nongradient algorithm for nonlinear nonconvex Lipschitzian optimization problems is propos...
A branch and bound algorithm for global optimization is proposed, where the maximum of an upper boun...
Many problems in economy may be formulated as global optimization problems. Most numerically promisi...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
This paper is devoted to the study of partition-based deterministic algorithms for global optimizati...
We consider a family of function classes which allow functions with several minima and which deman...
In this work, we present a new deterministic partition-based Global Optimization (GO) algorithm that...
AbstractA family of deterministic algorithms is introduced, designed to solve the global optimisatio...
An Adaptive Cubic Overestimation (ACO) algorithm for unconstrained optimization, generalizing a meth...
The global optimization problem min f(x), x in S with S=[a,b], a, b in Rn and f(x) satisfying the L...
AbstractA variant of the beta algorithm based on the cubic algorithm [1,2] is presented for global o...
A well-known example of global optimization that provides solutions within fixed error limits is opt...
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function m...
This work addresses the sequential optimization of an unknown and potentially nonconvex function ove...
AbstractA new algorithm for full global optimization of a Lipschitzian function over an arbitrary bo...
AbstractA nongradient algorithm for nonlinear nonconvex Lipschitzian optimization problems is propos...
A branch and bound algorithm for global optimization is proposed, where the maximum of an upper boun...
Many problems in economy may be formulated as global optimization problems. Most numerically promisi...
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve...
This paper is devoted to the study of partition-based deterministic algorithms for global optimizati...
We consider a family of function classes which allow functions with several minima and which deman...
In this work, we present a new deterministic partition-based Global Optimization (GO) algorithm that...
AbstractA family of deterministic algorithms is introduced, designed to solve the global optimisatio...
An Adaptive Cubic Overestimation (ACO) algorithm for unconstrained optimization, generalizing a meth...
The global optimization problem min f(x), x in S with S=[a,b], a, b in Rn and f(x) satisfying the L...
AbstractA variant of the beta algorithm based on the cubic algorithm [1,2] is presented for global o...
A well-known example of global optimization that provides solutions within fixed error limits is opt...
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function m...
This work addresses the sequential optimization of an unknown and potentially nonconvex function ove...