Computational comparison of two methods for constrained global optimization
type: Item
instance of: scholarly article
title: Computational comparison of two methods for constrained global optimization
zbMATH Open document ID: 0820.90101
DOI: 10.1007/BF01096682
author: A. T. Phillips
author: J. B. Rosen
published in: Journal of Global Optimization
publication date: 1995-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 711742
zbMATH Keywords: constrained concave global minimization
zbMATH Keywords: stochastic multistart approach
zbMATH Keywords: global minimum solution
zbMATH Keywords: test problems
zbMATH Keywords: separable concave objectives
zbMATH Keywords: computational comparison
MaRDI profile type: Publication
cites work: Separable concave minimization via partial outer approximation and branch and bound
cites work: Bayesian stopping rules for multistart global optimization methods
cites work: Sufficient conditions for solving linearly constrained separable concave global minimization problems
cites work: A parallel stochastic method for solving linearly constrained concave global minimization problems
cites work: Stochastic global optimization methods part I: Clustering methods
description: scientific article; zbMATH DE number 711742