title: Multistart method with deterministic restart mechanism
metadata.name: dc.contributor.author
metadata.value: Amirkhanova, Gulshat A.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Gorchakov, Andrei Y.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Duysenbaeva, Aigerim Z.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Posypkin, Michael A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2020-08-24T19:26:12Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2020-08-24T19:26:12Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2020-06
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Amirkhanova G.A., Gorchakov A.Y., Duysenbaeva A. J., Posypkin M.A. Multistart method with deterministic restart mechanism. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2020, vol. 16, iss. 2, pp. 100–111.
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/11701/spbu10.2020.202
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/19012
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: The work is devoted to the development and study of a method for solving global optimization
  problems with interval constraints. The paper proposes a global optimization algorithm based
  on a deterministic method of selecting starting points for local search methods. The starting
  points are the extremum points of functions of one variable, obtained by restricting the
  objective function to straight, collinear coordinate vectors. The effectiveness of the proposed
  algorithm is demonstrated by the example of the problem of minimizing the energy of a
  fragment of a flat crystal lattice. The energy of interatomic interaction is calculated using
  the Tersoff potential. An experimental comparison is made of the developed algorithm with
  the classical version of the multi-start method, in which pseudo-random points uniformly
  distributed in the parallelepiped are used to select starting points. As a local search method,
  in both cases, one of the modifications of the coordinate wise descent method is used. The
  developed method can be applied to problems with an unknown analytical expression for an
  objective function that is often encountered in practice.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: This work was financially supported by the Committee of Science of the Ministry of Education
  and Science of the Republic of Kazakhstan (grant no. AP05133366).
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 16; Issue 2
metadata.lang: -
metadata.name: dc.subject
metadata.value: global optimization
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: multi-start method
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: fill sequences
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Multistart method with deterministic restart mechanism
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 100-111.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/19012/1/100-111.pdf
resources.format: Adobe PDF
resources.size: 529,73 kB