Finiteness of conical algorithms with \(\omega\)-subdivisions
type: Item
instance of: scholarly article
title: Finiteness of conical algorithms with \(\omega\)-subdivisions
zbMATH Open document ID: 0973.90061
published in: Mathematical Programming. Series A. Series B
publication date: 2000-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1528058
zbMATH Keywords: concave optimization
zbMATH Keywords: conical algorithms
zbMATH Keywords: \(\omega\)-subdivisions
author: Marco Locatelli
MaRDI profile type: Publication
full work available at URL: s101070050073
OpenAlex ID: W2040964014
DOI: 10.1007/S101070050073
Recommended article: On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
Recommended article: Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
Recommended article: Finiteness conjecture and subdivision
Recommended article: A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
Recommended article: On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
Recommended article: Some Conjectures Concerning Complexity of PL subdivisions
Recommended article: On the complexity of subspaces of Sω
Recommended article: A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
Recommended article: Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations
Recommended article: Splitting in 2-computably enumerable degrees with avoiding cones
description: scientific article; zbMATH DE number 1528058