Primal-dual methods for vertex and facet enumeration
From MaRDI portal
Publication:1272960
DOI10.1007/PL00009389zbMath0910.68217OpenAlexW1495119384MaRDI QIDQ1272960
Komei Fukuda, Ambros Marzetta, David Bremner
Publication date: 12 April 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009389
Related Items
Exactly computing bivariate projection depth contours and median, Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints, Computation of projection regression depth and its induced median, Guaranteed deterministic approach to superhedging: a numerical experiment, Output-sensitive cell enumeration in hyperplane arrangements, Convex hulls, oracles, and homology, A new approach for the computation of halfspace depth in high dimensions, Computing projection depth and its associated estimators, \(l_{\infty}\)-based stability criteria and its applications on FLC systems, Computing multiple-output regression quantile regions, Unnamed Item, Coercive polynomials: stability, order of growth, and Newton polytopes, The negative cycles polyhedron and hardness of checking some polyhedral properties, Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets, Primal and dual approximation algorithms for convex vector optimization problems, Methods for estimation of convex sets, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers, Weighted sum model with partial preference information: application to multi-objective optimization, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., An algorithm to solve polyhedral convex set optimization problems, Computing Halfspace Depth and Regression Depth, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints, Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems, Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism, Extended convex hull, Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball, Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization, Multiparametric linear programming with applications to control, Computing multiple-output regression quantile regions from projection quantiles, Finding and identifying optimal inventory levels for systems with common components, A maximum entropy approach to the realizability of spin correlation matrices, Benson type algorithms for linear vector optimization and applications, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, Generating all vertices of a polyhedron is hard, The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable, AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS, Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities, Bell Inequalities with Auxiliary Communication, Two variations of graph test in double description method, Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms, Stabilization of the response of cyclically loaded lattice spring models with plasticity, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices, Coercive Polynomials and Their Newton Polytopes, Linearly constrained global optimization: a general solution algorithm with applications., Computing halfspace depth contours based on the idea of a circular sequence
