- Full text PDF available (12)
- This year (0)
- Last 5 years (2)
- Last 10 years (6)
Journals and Conferences
Inspired by a method by Jones et al. (1993), we present a global optimization algorithm based on multilevel coordinate search. It is guaranteed to converge if the function is continuous in the neighborhood of a global minimizer. By starting a local search from certain good points, an improved convergence result is obtained. We discuss implementation details… (More)
The software package SNOBFIT for bound-constrained (and soft-constrained) noisy optimization of an expensive objective function is described. It combines global and local search by branching and local fits. The program is made robust and flexible for practical use by allowing for hidden constraints, batch function evaluations, change of search regions, etc.
Results are reported of testing a number of existing state of the art solvers for global constrained optimization and constraint satisfaction on a set of over 1000 test problems in up to 1000 variables.
For constrained smooth or nonsmooth optimization problems, new continuously differentiable penalty functions are derived. They are proved exact in the sense that under some nondegeneracy assumption, local optimizers of a nonlinear program are precisely the optimizers of the associated penalty function. This is achieved by augmenting the dimension of the… (More)
Four methods for global numerical black box optimization with origins in the mathematical programming community are described and experimentally compared with the state of the art evolutionary method, BIPOP-CMA-ES. The methods chosen for the comparison exhibit various features that are potentially interesting for the evolutionary computation community:… (More)
Several local search algorithms for real-valued domains (axis parallel line search, Nelder-Mead simplex search, Rosenbrock's algorithm, quasi-Newton method, NEWUOA, and VXQR) are described and thoroughly compared in this article, embedding them in a multi-start method. Their comparison aims (1) to help the researchers from the evolutionary community to… (More)
In this report we compare two stochastic algorithms for global optimization, PGSL by Raphael & Smith  and global by Csendes  with the deterministic algorithm MCS by Huyer & Neumaier  on the test set used by Jones et al. , which consists of the seven standard test functions from Dixon & Szegö  and two test functions from Yao  with the… (More)
We consider a size-structured population model with discontinuous reproduction and feedback through the environmental variable \substrate". The model admits solutions with nitely many cohorts and in that case the problem is described by a system of ODEs involving a bifurcation parameter. Existence of nontrivial periodic n-cohort solutions is investigated.… (More)
In this paper a variational version of the Trotter-Kato theorem is applied to an innnitesimal generator A of a C 0-semigroup in a Hilbert space that is assumed to be the sum of two linear operators A and B deened on the intersection of their domains, where A ? !I is m-dissipative for some ! > 0 and B is the generator of an analytic semigroup associated with… (More)