Bisecton by global optimization revisited
type: Item
instance of: scholarly article
title: Bisecton by global optimization revisited
zbMATH Open document ID: 1184.90129
published in: Journal of Optimization Theory and Applications
publication date: 2010-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5696835
zbMATH Keywords: global optimization
zbMATH Keywords: nonconvex programming
zbMATH Keywords: mathematical programming
zbMATH Keywords: finite element methods
zbMATH Keywords: computational convexity
zbMATH Keywords: subdivisions
zbMATH Keywords: triangulation of polytopes
author: Reiner Horst
MaRDI profile type: Publication
full work available at URL: s10957-009-9610-8
OpenAlex ID: W2152090939
cites work: Q4889854
cites work: Introduction to global optimization.
cites work: An algorithm for nonconvex programming problems
cites work: A note on the convergence of an algorithm for nonconvex programming problems
cites work: On generalized bisection of 𝑛-simplices
cites work: Subdivision of simplices relative to a cutting plane and finite concave minimization
cites work: Q4274017
cites work: Q3772828
cites work: Q5547252
cites work: Q4309969
cites work: On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
cites work: On-line and off-line vertex enumeration by adjacency lists
DOI: 10.1007/S10957-009-9610-8
description: scientific article; zbMATH DE number 5696835