P-algorithm based on a simplicial statistical model of multimodal functions
type: Item
instance of: scholarly article
title: P-algorithm based on a simplicial statistical model of multimodal functions
zbMATH Open document ID: 1206.90131
author: Antanas Žilinskas
author: Julius Žilinskas
published in: Top
publication date: 2011-01-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5842733
zbMATH Keywords: statistical models of multimodal functions
zbMATH Keywords: global optimization
zbMATH Keywords: simplicial partition
describes a project that uses: LGO
describes a project that uses: Global Optimization Toolbox For Maple
describes a project that uses: SimpleS
MaRDI profile type: Publication
full work available at URL: s11750-010-0153-9
OpenAlex ID: W2016909355
cites work: Algorithmic copositivity detection by simplicial partition
cites work: On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
cites work: One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
cites work: Probabilistic subproblem selection in branch-and-bound algorithms
cites work: Q5528344
cites work: Algorithm 860
cites work: A radial basis function method for global optimization
cites work: Q4833810
cites work: An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
cites work: Testing heuristics: We have it all wrong
cites work: On generalized bisection of 𝑛-simplices
cites work: Q4889854
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: A versatile stochastic model of a function of unknown and time varying form
cites work: Q3658969
cites work: Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
cites work: IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Interpolation of spatial data. Some theory for kriging
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Stochastic global optimization.
cites work: Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
cites work: A review of statistical models for global optimization
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
cites work: Global optimization based on a statistical model and simplicial partitioning.
DOI: 10.1007/S11750-010-0153-9
description: scientific article; zbMATH DE number 5842733