Finiteness of conical algorithms with \(\omega\)-subdivisions

DOI10.1007/s101070050073zbMath0973.90061OpenAlexW2040964014MaRDI QIDQ1586206

Marco Locatelli

Publication date: 12 November 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050073

zbMATH Keywords

\(\omega\)-subdivisionsconical algorithmsconcave optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (4)

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

This page was built for publication: Finiteness of conical algorithms with \(\omega\)-subdivisions