A simple finite cone covering algorithm for concave minimization

DOI10.1023/A:1026548217241zbMath0974.90017OpenAlexW54258423MaRDI QIDQ5930000

Christophe Meyer

Publication date: 16 December 2001

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

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

zbMATH Keywords

concave minimizationcone covering algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (3)

A hybrid method for quantum global optimization ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming

This page was built for publication: A simple finite cone covering algorithm for concave minimization