A simple finite cone covering algorithm for concave minimization

DOI10.1023/A:1026548217241MaRDI QIDQ5930000zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1795726
• scientific article; zbMATH DE number 1795202
• Normal conical algorithm for concave minimization over polytopes
• Concave minimization via conical partitions and polyhedral outer approximation
• A finite algorithm for concave minimization over a polyhedron

Cited in

(13)

• Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization
• A finite algorithm for concave minimization over a polyhedron
• scientific article; zbMATH DE number 2190131 (Why is no real title available?)
• A hybrid method for quantum global optimization
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
• Normal conical algorithm for concave minimization over polytopes
• A simplified convergence proof for the cone partitioning algorithm
• On geometry and convergence of a class of simplicial covers
• scientific article; zbMATH DE number 1795726 (Why is no real title available?)
• A simplicial algorithm for concave minimization and its performance as a heuristic tool
• A finite concave minimization algorithm using branch and bound and neighbor generation
• A dual method for polar cuts in disjoint bilinear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930000)