Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Ya. D. Sergeyev"'
In this paper we consider the problem of finding an optimal value of the shape parameter in radial basis function interpolation. In particular, we propose the use of a leave-one-out cross validation (LOOCV) technique combined with univariate global o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c32dbf5c59ef2ff3fc6ce18580d77af4
http://hdl.handle.net/2318/1791182
http://hdl.handle.net/2318/1791182
Multi-derivative one-step methods based upon Euler-Maclaurin integration formulae are considered for the solution of canonical Hamiltonian dynamical systems. Despite the negative result that simplecticity may not be attained by any multi-derivative R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::016d22dbd4f343c0ac58d0c5862e3e77
http://arxiv.org/abs/1807.10952
http://arxiv.org/abs/1807.10952
Publikováno v:
Scientific Reports, Vol 8, Iss 1, Pp 1-9 (2018)
Scientific Reports
Scientific Reports
Global optimization problems where evaluation of the objective function is an expensive operation arise frequently in engineering, decision making, optimal control, etc. There exist two huge but almost completely disjoint communities (they have diffe
Autor:
Ya. D. Sergeyev, Dmitri E. Kvasov
Publikováno v:
Automation and Remote Control. 74:1435-1448
Many control problems involve the search for the global extremum in the space of states or the parameters of the system under study, which leads to the necessity of using effective methods of global finite-dimensional optimization. For this purpose u
Publikováno v:
AIP Conference Proceedings.
New algorithms for the numerical solution of Ordinary Differential Equations (ODEs) with initial conditions are proposed. They are designed for working on a new kind of a supercomputer – the Infinity Computer – that is able to deal numerically wi
Autor:
D. Lera, Ya. D. Sergeyev
Publikováno v:
Applied Numerical Mathematics. 60:115-129
In this paper, the global optimization problem min"y"@?"SF(y) with S=[a,b], a,[email protected]?R^N, and F(y) satisfying the Lipschitz condition, is considered. To deal with it four algorithms are proposed. All of them use numerical approximations of
Publikováno v:
Journal of Global Optimization. 25:345-362
The performance of interval analysis branch-and-bound global optimization algorithms strongly depends on the efficiency of selection, bounding, elimination, division, and termination rules used in their implementation. All the information obtained du
Autor:
A. Molinaro, Ya. D. Sergeyev
Publikováno v:
Measurement. 30:187-196
A new algorithm for fast determining the first zero crossing point over an interval is proposed. This problem arises in a number of applications, for example, in the determination of the phase difference between two signals. The method uses only the
Autor:
Ya. D. Sergeyev
Publikováno v:
Journal of Optimization Theory and Applications. 107:145-168
In this paper, the problem of the minimal description of the structure offunctional f(x) over an N-dimensional interval is considered. Thedescription is obtained by applying diagonal algorithms, i.e., proceduressequentially partitioning the given hyp
Publikováno v:
IFAC Proceedings Volumes. 33:225-230
We propose in this note a Global Optimization algorithm for multivariable constrained problems and apply it to the robust synthesis of PI controllers. The results we obtain on some test problems taken from the recent literature are reported.