Author image not provided
 Yaroslav D Sergeyev

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.08
Citation Count269
Publication count38
Publication years1994-2018
Available for download1
Average downloads per article1,060.00
Downloads (cumulative)1,060
Downloads (12 Months)39
Downloads (6 Weeks)10
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


38 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 38
Result page: 1 2

Sort by:

1
February 2018 Applied Mathematics and Computation: Volume 318 Issue C, February 2018
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. ...
Keywords: Lexicographic problems, Multi-objective optimization, Grossone infinity computing, Numerical infinitesimals

2
February 2018 Applied Mathematics and Computation: Volume 318 Issue C, February 2018
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0

Multiextremal multidimensional optimization problems are considered.Numerical methods of global optimization are the subject of study.Schemes of dimensionality reduction based on nested optimization and Peano-type space-filling curves are applied in the research.Global convergence of numerical methods combining the dimensionality reduction schemes and characteristical algorithms is theoretically substantiated.Numerical comparison of the methods ...
Keywords: 65K05, 90C26, Comparison of efficiency, Dimensionality reduction, Global optimization, Multiextremal functions, Convergence, Numerical methods

3
June 2017
Bibliometrics:
Citation Count: 0

This book begins with a concentrated introduction into deterministic global optimization and moves forward to present new original results from the authors who are well known experts in the field. Multiextremal continuous problems that have an unknown structure with Lipschitz objective functions and functions having the first Lipschitz derivatives defined ...

4
October 2016 Journal of Optimization Theory and Applications: Volume 171 Issue 1, October 2016
Publisher: Plenum Press
Bibliometrics:
Citation Count: 0

Geometric and information frameworks for constructing global optimization algorithms are considered, and several new ideas to speed up the search are proposed. The accelerated global optimization methods automatically realize a local behavior in the promising subregions without the necessity to stop the global optimization procedure. Moreover, all the trials executed ...
Keywords: 65B99, Local improvement, Local tuning, 90C26, Deterministic global optimization, Derivative-free algorithms, Lipschitz functions

5
March 2015 Applied Mathematics and Computation: Volume 255 Issue C, March 2015
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 0


6
February 2015 Advances in Engineering Software: Volume 80 Issue C, February 2015
Publisher: Elsevier Science Ltd.
Bibliometrics:
Citation Count: 4

In many important design problems, some decisions should be made by finding the global optimum of a multiextremal objective function subject to a set of constrains. Frequently, especially in engineering applications, the functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. Such computationally challenging ...
Keywords: Black-box functions, Global optimization, Lipschitz condition, Applied problems, Derivative-free methods, Geophysical inverse problems

7
November 2014 Journal of Global Optimization: Volume 60 Issue 3, November 2014
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0


8
July 2014 Journal of Global Optimization: Volume 59 Issue 2-3, July 2014
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 14

Direct-type global optimization algorithms often spend an excessive number of function evaluations on problems with many local optima exploring suboptimal local minima, thereby delaying discovery of the global minimum. In this paper, a globally-biased simplicial partition Disimpl algorithm for global optimization of expensive Lipschitz continuous functions with an unknown Lipschitz ...
Keywords: Global optimization, Lipschitz condition, Globally-biased Disimpl algorithm, Two-phase approach, Direct algorithm

9
September 2013 Automation and Remote Control: Volume 74 Issue 9, September 2013
Publisher: Plenum Press
Bibliometrics:
Citation Count: 4

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 use can be made of the geometric algorithms of Lipschitz global ...

10
August 2013
Bibliometrics:
Citation Count: 16

Introduction to Global Optimization Exploiting Space-Filling Curves provides an overview of classical and new results pertaining to the usage of space-filling curves in global optimization. The authors look at a family of derivative-free numerical algorithms applying space-filling curves to reduce the dimensionality of the global optimization problem; along with a ...

11
August 2013 The Journal of Supercomputing: Volume 65 Issue 2, August 2013
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 4

The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on single and multi-tape Turing machines, which are described and observed through the lens of a new mathematical language, which is strongly ...
Keywords: Theory of automatic computations, Relativity of mathematical languages, Infinite sets, Observability of Turing machines, Infinite sequences

12
July 2013 Applied Mathematics and Computation: Volume 219 Issue 22, July, 2013
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 4

There exists a huge number of numerical methods that iteratively construct approximations to the solution y(x) of an ordinary differential equation (ODE) y^'(x)=f(x,y) starting from an initial value y"0=y(x"0) and using a finite approximation step h that influences the accuracy of the obtained approximation. In this paper, a new framework ...
Keywords: Infinity Computer, Ordinary differential equations, Combining finite and infinitesimal approximation steps, Numerical infinitesimals

13
October 2012 Journal of Computational and Applied Mathematics: Volume 236 Issue 16, October, 2012
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 13

A global optimization problem is studied where the objective function f(x) is a multidimensional black-box function and its gradient f^'(x) satisfies the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant K. Different methods for solving this problem by using an a priori given estimate of K, its adaptive ...
Keywords: Lipschitz gradients, Global optimization, Set of Lipschitz constants, 90C56, Geometric algorithms, 65K05, 90C26

14
October 2011 Informatica: Volume 22 Issue 4, October 2011
Publisher: IOS Press
Bibliometrics:
Citation Count: 1

Many biological processes and objects can be described by fractals. The paper uses a new type of objects – blinking fractals – that are not covered by traditional theories considering dynamics of self-similarity processes. It is shown that both traditional and blinking fractals can be successfully studied by a recent ...
Keywords: Infinite And Infinitesimal Numbers, Mathematical Modeling In Biology, Process Of Growth, Traditional And Blinking Fractals

15
September 2010 ACRI'10: Proceedings of the 9th international conference on Cellular automata for research and industry
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Traditional computers work numerically only with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this lecture, a new computational methodology (that is not related to non-standard analysis approaches) is described. It is based on the principle 'The part is less ...
Keywords: numeral systems, Infinity computer, infinite and infinitesimal numbers, turing machine, numerical computations

16
September 2010 Journal of Global Optimization: Volume 48 Issue 1, September 2010
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0


17
September 2010 Journal of Global Optimization: Volume 48 Issue 1, September 2010
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 3

In this paper, the global optimization problem with a multiextremal objective function satisfying the Lipschitz condition over a hypercube is considered. An algorithm that belongs to the class of information methods introduced by R.G. Strongin is proposed. The knowledge of the Lipschitz constant is not supposed. The local tuning on ...
Keywords: Local information, Acceleration, Global optimization

18
August 2010 Informatica: Volume 21 Issue 3, August 2010
Publisher: IOS Press
Bibliometrics:
Citation Count: 7

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep ...
Keywords: theory of automatic computations, infinite sets, observability of Turing machines, relativity of mathematical languages, Sapir-Whorf thesis

19
January 2010 Applied Numerical Mathematics: Volume 60 Issue 1-2, January, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 6

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 space-filling curves to reduce the original Lipschitz multi-dimensional problem to a univariate one satisfying the Holder ...
Keywords: Local information, Space-filling curves approximations, Acceleration, Global optimization, Lipschitz and Hölder functions

20
December 2008 Informatica: Volume 19 Issue 4, December 2008
Publisher: IOS Press
Bibliometrics:
Citation Count: 9

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite ...
Keywords: infinite and infinitesimal numbers, infinite unite of measure, infinite sets, divergent series, numeral systems



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us