On convergence rate of a rectangular partition based global optimization algorithm
type: Item
instance of: scholarly article
title: On convergence rate of a rectangular partition based global optimization algorithm
zbMATH Open document ID: 1402.90125
author: Gražina Gimbutienė
author: William O. Phillips
author: Antanas Žilinskas
author: James M. Calvin
published in: Journal of Global Optimization
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6876823
zbMATH Keywords: global optimization
zbMATH Keywords: convergence rate
zbMATH Keywords: rectangular partition
zbMATH Keywords: statistical models for global optimization
zbMATH Keywords: Bayesian approach
zbMATH Keywords: P-algorithm
describes a project that uses: CGAL
describes a project that uses: Global Optimization Toolbox For Maple
MaRDI profile type: Publication
full work available at URL: s10898-018-0636-z
OpenAlex ID: W2793202458
cites work: Deterministic global optimization. Theory, methods and applications
cites work: Introduction to global optimization
cites work: Q4889854
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: Multidimensional global optimization using the first derivatives
cites work: A deterministic global optimization using smooth diagonal auxiliary functions
cites work: Deterministic Global Optimization
cites work: Q3658969
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Q4000303
cites work: A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
cites work: Q4640242
cites work: Testing heuristics: We have it all wrong
cites work: Handbook of global optimization. Vol. 2
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: A hybrid global optimization algorithm for nonlinear least squares regression
cites work: One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
cites work: Q4917438
cites work: An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions
cites work: On a global optimization algorithm for bivariate smooth functions
cites work: Tractability of multivariate problems. Volume II: Standard information for functionals.
cites work: Global optimization by multilevel coordinate search
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Deterministic global optimization. Geometric branch-and-bound methods and their applications
cites work: Simplicial Global Optimization
cites work: Deterministic and stochastic error bounds in numerical analysis
cites work: Stochastic global optimization.
cites work: Q4250308
cites work: Q4788644
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: On the Systematic Search in a Hypercube
cites work: Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
cites work: Q4833810
cites work: Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
Wikidata QID: Q130157699
DOI: 10.1007/S10898-018-0636-Z
description: scientific article; zbMATH DE number 6876823