Global optimization on convex sets
type: Item
instance of: scholarly article
title: Global optimization on convex sets
zbMATH Open document ID: 0618.90085
DOI: 10.1007/BF01721128
author: B. George
published in: OR Spektrum
publication date: 1986-01-01T00:00:00Z
review text: This clearly written paper shows that a general class of global optimization procedures, operating on intervals in \({\mathbb{R}}^ n\), can be applied also on compact convex sets with a nonempty interior: for this only an appropriate Lipschitzian extension of the objective function to an imbedding interval is necessary. Applications are indicated to linearly constrained problems and also to nonlinearly constrained problems. For computational aspects see another paper of the author [Computing 36, 91-103 (1986; Zbl 0572.65047)].
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4003930
zbMATH Keywords: compact convex sets
zbMATH Keywords: multiextremal optimization
zbMATH Keywords: global optimization procedures
zbMATH Keywords: Lipschitzian extension
reviewed by: Johannes W. Nieuwenhuis
MaRDI profile type: Publication
cites work: Q3939610
cites work: On statistical control of optimization
cites work: Sequential stopping rules for the multistart algorithm in global optimisation
cites work: A stochastic method for global optimization
cites work: On the global minimization of concave functions
cites work: Convergence properties of stochastic optimization procedures
cites work: Globally convergent methods for n-dimensional multiextremal optimization
cites work: Extended univariate algorithms for \(n\)-dimensional global optimization
cites work: The Supporting Hyperplane Method for Unimodal Programming
cites work: Non-Linear Programming Via Penalty Functions
cites work: Axiomatic approach to statistical models and their use in multimodal optimization theory
description: scientific article; zbMATH DE number 4003930