A simplified convergence proof for the cone partitioning algorithm
type: Item
instance of: scholarly article
title: A simplified convergence proof for the cone partitioning algorithm
zbMATH Open document ID: 0916.90221
DOI: 10.1023/A:1008325507949
author: Brigitte Jaumard
author: Christophe Meyer
published in: Journal of Global Optimization
publication date: 1999-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1267900
zbMATH Keywords: \(\omega\)-subdivision
zbMATH Keywords: (quasi)concave minimization
zbMATH Keywords: convergence result
zbMATH Keywords: cone partitioning
MaRDI profile type: Publication
full work available at URL: a:1008325507949
OpenAlex ID: W1575871118
Recommended article: On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
Recommended article: A fixed parameter algorithm for optimal convex partitions
Recommended article: A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
Recommended article: A Cone-Continuity Constraint Qualification and Algorithmic Consequences
Recommended article: Conical partition algorithm for maximizing the sum of dc ratios
Recommended article: A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
Recommended article: Approximation Algorithms for the Minimum Convex Partition Problem
Recommended article: The convergence of partitioning dual bounds for partial convex optimization problems
Recommended article: A simple finite cone covering algorithm for concave minimization
Recommended article: Concave minimization via conical partitions and polyhedral outer approximation
description: scientific article; zbMATH DE number 1267900