Approximating polyhedra with sparse inequalities
From MaRDI portal
Publication:896289
Recommendations
- Static Analysis
- Some lower bounds on sparse outer approximations of polytopes
- Approximate convex decomposition of polyhedra and its applications
- Optimization and approximation for polyhedra in separable Hilbert spaces
- scientific article; zbMATH DE number 895293
- On polyhedral approximations in an \(n\)-dimensional space
- scientific article; zbMATH DE number 4120902
- Polyhedral approximation of smooth convex bodies
- Approximating a planar convex set using a sparse grid
- Approximation for minimum triangulation of convex polyhedra
Cites work
- scientific article; zbMATH DE number 1538119 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Block-$LU$ Update for Large-Scale Linear Programming
- A probabilistic analysis of the strength of the split and triangle closures
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Coordinated cutting plane generation via multi-objective separation
- Large sparse numerical optimization
- On defining sets of vertices of the hypercube by linear inequalities
- On the relative strength of split, triangle and quadrilateral cuts
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Order Statistics
- Probability for statistics and machine learning. Fundamentals and advanced topics.
- Separation algorithms for 0-1 knapsack polytopes
- Solving Real-World Linear Programs: A Decade and More of Progress
- Some lower bounds on sparse outer approximations of polytopes
- The vertex separator problem: a polyhedral investigation
- Worst-case comparison of valid inequalities for the TSP
- Zero-coefficient cuts
Cited in
(24)- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Sparsity of lift-and-project cutting planes
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Experimental validation of volume-based comparison for double-McCormick relaxations
- Sparsity of integer formulations for binary programs
- Branch-and-bound solves random binary IPs in poly\((n)\)-time
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- How good are sparse cutting-planes?
- Sparse PSD approximation of the PSD cone
- Some lower bounds on sparse outer approximations of polytopes
- Split cuts from sparse disjunctions
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
- Projection onto a polyhedron that exploits sparsity
- Volume computation for sparse Boolean quadric relaxations
- A node elimination algorithm for cubature of high-dimensional polytopes
- A lexicographic pricer for the fractional bin packing problem
- Strong IP formulations need large coefficients
- Theoretical challenges towards cutting-plane selection
- Distance-sparsity transference for vertices of corner polyhedra
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Cutting plane generation through sparse principal component analysis
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Easy and hard separation of sparse and dense odd-set constraints in matching
This page was built for publication: Approximating polyhedra with sparse inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896289)
