Double description method revisited

DOI10.1007/3-540-61576-8_77zbMATH Open1543.68253MaRDI QIDQ6567674FDOQ6567674

Authors: Komei Fukuda, A. Prodon 

Publication date: 5 July 2024

Recommendations

• A dynamic algorithm for constructing the dual representation of a polyhedral cone
• New modification of the double description method for constructing the skeleton of a polyhedral cone
• Average-case analysis of the double description method and the beneath-beyond algorithm
• Two variations of graph test in double description method
• The Complexity of Vertex Enumeration Methods

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Title not available (Why is that?)
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• The inequicut cone
• How good are convex hull algorithms?
• Title not available (Why is that?)
• The Complexity of Vertex Enumeration Methods

Cited In (3)

• A polyhedral approximation algorithm for recession cones of spectrahedral shadows
• Full-low evaluation methods for bound and linearly constrained derivative-free optimization
• New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems

This page was built for publication: Double description method revisited

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