A simplified convergence proof for the cone partitioning algorithm

DOI10.1023/A:1008325507949zbMath0916.90221OpenAlexW1575871118MaRDI QIDQ1281480

Brigitte Jaumard, Christophe Meyer

Publication date: 21 July 1999

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008325507949

zbMATH Keywords

convergence result\(\omega\)-subdivision(quasi)concave minimizationcone partitioning

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (5)

A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm ⋮ A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies ⋮ On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ A convergent conical algorithm with \(\omega \)-bisection for concave minimization ⋮ On the convergence of cone splitting algorithms with \(\omega\)-subdivisions

This page was built for publication: A simplified convergence proof for the cone partitioning algorithm