Pages that link to "Item:Q1272960"
From MaRDI portal
The following pages link to Primal-dual methods for vertex and facet enumeration (Q1272960):
Displaying 50 items.
- Computing halfspace depth contours based on the idea of a circular sequence (Q256759) (← links)
- Computing multiple-output regression quantile regions (Q433245) (← links)
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets (Q471019) (← links)
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints (Q538293) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems (Q706993) (← links)
- A maximum entropy approach to the realizability of spin correlation matrices (Q742783) (← links)
- Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
- Computation of projection regression depth and its induced median (Q830082) (← links)
- Computing projection depth and its associated estimators (Q892443) (← links)
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
- Combinatorial face enumeration in convex polytopes (Q1334609) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- \(l_{\infty}\)-based stability criteria and its applications on FLC systems (Q1408834) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Methods for estimation of convex sets (Q1730906) (← links)
- On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers (Q1745312) (← links)
- Weighted sum model with partial preference information: application to multi-objective optimization (Q1753485) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities (Q2071967) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- Guaranteed deterministic approach to superhedging: a numerical experiment (Q2130707) (← links)
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Exactly computing bivariate projection depth contours and median (Q2361217) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- Multiparametric linear programming with applications to control (Q2512098) (← links)
- Computing multiple-output regression quantile regions from projection quantiles (Q2512766) (← links)
- Finding and identifying optimal inventory levels for systems with common components (Q2519082) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Bell inequalities with auxiliary communication (Q2837726) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- An algorithm to solve polyhedral convex set optimization problems (Q4916312) (← links)
- AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS (Q4979885) (← links)
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395) (← links)
- Stabilization of the response of cyclically loaded lattice spring models with plasticity (Q4999585) (← links)
- (Q5009558) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← links)
- A new approach for the computation of halfspace depth in high dimensions (Q5086196) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Computing Halfspace Depth and Regression Depth (Q5415897) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
