Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
type: Item
instance of: scholarly article
title: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
zbMATH Open document ID: 1066.90094
published in: Journal of Optimization Theory and Applications
publication date: 2005-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 2171464
zbMATH Keywords: Partitioning
zbMATH Keywords: minimal description
zbMATH Keywords: one-point-based algorithms
zbMATH Keywords: global optimization
author: Yaroslav D. Sergeyev
describes a project that uses: Global Optimization Toolbox For Maple
MaRDI profile type: Publication
full work available at URL: s10957-004-0948-7
OpenAlex ID: W2964112186
cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
cites work: A deterministic algorithm for global optimization
cites work: A comparison of global optimization methods for the design of a high-speed civil transport
cites work: Subdivision Direction Selection in Interval Methods for Global Optimization
cites work: The cubic algorithm
cites work: A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
cites work: A fully-distributed parallel global search algorithm
cites work: The bisection method in higher dimensions
DOI: 10.1007/S10957-004-0948-7
description: scientific article; zbMATH DE number 2171464