Realizability and inscribability for simplicial polytopes via nonlinear optimization
type: Item
instance of: scholarly article
title: Realizability and inscribability for simplicial polytopes via nonlinear optimization
zbMATH Open document ID: 1379.52017
author: Moritz Firsching
published in: Mathematical Programming. Series A. Series B
publication date: 2017-12-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/1508.02531
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 52C40
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6814730
zbMATH Keywords: nonlinear optimization techniques
zbMATH Keywords: matroid polytopes
zbMATH Keywords: simplicial spheres
describes a project that uses: PPL
describes a project that uses: SageMath
describes a project that uses: OEIS
describes a project that uses: SCIP
describes a project that uses: Ipopt
MaRDI profile type: Publication
OpenAlex ID: W2218862664
arXiv ID: 1508.02531
cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP
cites work: The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes
cites work: SCIP: solving constraint integer programs
cites work: Neighborly 4-Polytopes and Neighborly Combinatorial 3-Manifolds with Ten Vertices
cites work: The number of simplicial neighbourly d ‐polytopes with d +3 vertices
cites work: Universality theorems for inscribed polytopes and Delaunay triangulations
cites work: Neighborly 4-polytopes with 9 vertices
cites work: The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
cites work: Two interesting oriented matroids
cites work: Symmetric matroid polytopes and their generation
cites work: A structure theorem for pseudomanifolds
cites work: More bounds on the diameters of convex polytopes
cites work: On combinatorial and affine automorphisms of polytopes
cites work: Q3200151
cites work: Oriented Matroids
cites work: On the finding of final polynomials
cites work: Voronoi diagrams from convex hulls
cites work: Many triangulated spheres
cites work: Neighborly 6-polytopes with 10 vertices
cites work: Computational synthetic geometry
cites work: Equifacetted 3-spheres as topes of nonpolytopal matroid polytopes
cites work: Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets
cites work: The Number of Rooted Convex Polyhedra
cites work: Graph-theoretical conditions for inscribability and Delaunay realizability
cites work: Neighborliness of randomly projected simplices in high dimensions
cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming
cites work: Combinatorial \(3\)-manifolds with \(10\) vertices
cites work: Simplicial neighbourly 5-polytopes with nine vertices
cites work: Computing Maximal Copies of Polyhedra Contained in a Polyhedron
cites work: Complete enumeration of small realizable oriented matroids
cites work: Counting \(d\)-polytopes with \(d+3\) vertices
cites work: Q5511980
cites work: Neighborly inscribed polytopes and Delaunay triangulations
cites work: Q5547252
cites work: An enumeration of simplicial 4-polytopes with 8 vertices
cites work: Inscribable stacked polytopes
cites work: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
cites work: Sphären mit wenigen Ecken
cites work: The number of d ‐polytopes with d +3 vertices
cites work: Neighborly polytopes and oriented matroids
cites work: Spheres with few vertices
cites work: Counting polytopes via the Radon complex
cites work: The maximum numbers of faces of a convex polytope
cites work: The number of neighbourly d ‐polytopes with d +3 vertices
cites work: Enumerating Neighborly Polytopes and Oriented Matroids
cites work: Q3819622
cites work: Many neighborly polytopes and oriented matroids
cites work: Realization spaces of 4-polytopes are universal
cites work: The Asymptotic Number of Convex Polyhedra
cites work: Rational points on the unit sphere
cites work: Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
cites work: Neighborly polytopes
cites work: Q3974991
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q5764859
cites work: Boundary Complexes of Convex Polytopes cannot Be Characterized Locally

Realizability and inscribability for simplicial polytopes via nonlinear optimization (cites work)
cites work: On the enumeration of convex polyhedra

Realizability and inscribability for simplicial polytopes via nonlinear optimization (cites work)
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

Realizability and inscribability for simplicial polytopes via nonlinear optimization (cites work)
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

Realizability and inscribability for simplicial polytopes via nonlinear optimization (DOI)
DOI: 10.1007/S10107-017-1120-0