Adaptive nested optimization scheme for multidimensional global search
type: Item
instance of: scholarly article
title: Adaptive nested optimization scheme for multidimensional global search
zbMATH Open document ID: 1355.90072
author: Alexander Gergel
author: Victor P. Gergel
author: Vladimir A. Grishagin
published in: Journal of Global Optimization
publication date: 2016-10-26T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6643280
zbMATH Keywords: multidimensional multiextremal optimization
zbMATH Keywords: global search algorithms
zbMATH Keywords: dimensionality reduction
zbMATH Keywords: adaptive nested optimization scheme
describes a project that uses: LGO
describes a project that uses: Algorithm 829
describes a project that uses: Global Optimization Toolbox For Maple
MaRDI profile type: Publication
full work available at URL: s10898-015-0355-7
OpenAlex ID: W1241353122
cites work: Space filling curves and mathematical programming
cites work: Q5531564
cites work: One-dimensional nested maximin designs
cites work: A review of recent advances in global optimization
cites work: Encyclopedia of optimization. In 6 vols.
cites work: Algorithm 829
cites work: Global optimization with space-filling curves.
cites work: Q3885544
cites work: Parallel characteristical algorithms for solving problems of global optimization
cites work: Q3698658
cites work: Handbook of global optimization
cites work: Introduction to global optimization
cites work: Q3997222
cites work: Local tuning and partition strategies for diagonal GO methods
cites work: Q5317017
cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: An algorithm for finding the absolute extremum of a function
cites work: A parallel method for finding the global minimum of univariate functions
cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
cites work: Q4423178
cites work: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
cites work: Introduction to Global Optimization Exploiting Space-Filling Curves
cites work: Nested Partitions Method for Global Optimization
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: On Solving Optimization Problems with Hidden Nonconvex Structures
cites work: Q3908420
cites work: The information approach to multiextremal optimization problems
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Global optimization
cites work: Q4000303
cites work: Comparison of independent, stratified and random covering sample schemes in optimization problems
DOI: 10.1007/S10898-015-0355-7
description: scientific article; zbMATH DE number 6643280