Solving a set of global optimization problems by the parallel technique with uniform convergence
type: Item
instance of: scholarly article
title: Solving a set of global optimization problems by the parallel technique with uniform convergence
zbMATH Open document ID: 1402.90124
author: Konstantin Barkalov
author: Roman G. Strongin
published in: Journal of Global Optimization
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6876815
zbMATH Keywords: global optimization
zbMATH Keywords: Peano-type space filling curves
zbMATH Keywords: uniform convergence
zbMATH Keywords: parallel computing
describes a project that uses: LGO
describes a project that uses: Algorithm 829
describes a project that uses: Global Optimization Toolbox For Maple
describes a project that uses: DIRECT
MaRDI profile type: Publication
full work available at URL: s10898-017-0555-4
OpenAlex ID: W2750444590
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Introduction to Global Optimization Exploiting Space-Filling Curves
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: A deterministic approach to global box-constrained optimization
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
cites work: Local tuning and partition strategies for diagonal GO methods
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: Q3652457
cites work: Design and implementation of a massively parallel version of DIRECT
cites work: Multicriteria Optimization
cites work: A parallel method for finding the global minimum of univariate functions
cites work: Parallel characteristical algorithms for solving problems of global optimization
cites work: Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
cites work: Q5317003
cites work: Global optimization: Fractal approach and non-redundant parallelism
cites work: Parallel global optimization on GPU
cites work: On the worst-case optimal multi-objective global optimization
cites work: Algorithm 829
DOI: 10.1007/S10898-017-0555-4
description: scientific article; zbMATH DE number 6876815