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

DOI10.1007/BF00121751zbMATH Open0860.90096OpenAlexW1969568541MaRDI QIDQ1817320FDOQ1817320

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

global optimizationtriangulationconcave minimizationsimplicial branch-and-bound approachsimplicial subdivisions

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

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

Cited In (11)

• Separating subdivision of bicycle wheel inequalities over cut polytopes
• Simplicial Lipschitz optimization without the Lipschitz constant
• THE PROBLEM OF CUTTING SUBSPACES
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
• On geometry and convergence of a class of simplicial covers
• A new simplicial cover technique in constrained global optimization
• Bisecton by global optimization revisited
• Title not available (Why is that?)
• Finite exact branch-and-bound algorithms for concave minimization over polytopes

   Recommendations

• Finite exact branch-and-bound algorithms for concave minimization over polytopes 👍 👎
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron 👍 👎
• Concave minimization via conical partitions and polyhedral outer approximation 👍 👎
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions 👍 👎

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

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