Subdivision of simplices relative to a cutting plane and finite concave minimization

DOI10.1007/BF00121751zbMath0860.90096OpenAlexW1969568541MaRDI QIDQ1817320

Michael Nast

Publication date: 1 December 1996

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

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

zbMATH Keywords

triangulationglobal optimizationconcave minimizationsimplicial branch-and-bound approachsimplicial subdivisions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ Bisecton by global optimization revisited

Cites Work

• Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\)
• A triangulation of the 6-cube with 308 simplices
• A simple and relatively efficient triangulation of the n-cube
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• The computation of fixed points and applications
• A finite concave minimization algorithm using branch and bound and neighbor generation
• Introduction to global optimization
• A finite algorithm for concave minimization over a polyhedron
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• An algorithm for nonconvex programming problems
• A Successive Underestimation Method for Concave Minimization Problems
• Optimal Facility Location with Concave Costs
• An Algorithm for Separable Nonconvex Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subdivision of simplices relative to a cutting plane and finite concave minimization