Approximating polyhedra with sparse inequalities
From MaRDI portal
Publication:896289
DOI10.1007/S10107-015-0925-YzbMATH Open1327.90134OpenAlexW942484584MaRDI QIDQ896289FDOQ896289
Authors: Santanu S. Dey, Marco Molinaro, Qianyi Wang 
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0925-y
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- On defining sets of vertices of the hypercube by linear inequalities
- Separation algorithms for 0-1 knapsack polytopes
- Order Statistics
- The vertex separator problem: a polyhedral investigation
- Worst-case comparison of valid inequalities for the TSP
- Solving Real-World Linear Programs: A Decade and More of Progress
- On the relative strength of split, triangle and quadrilateral cuts
- Probability for statistics and machine learning. Fundamentals and advanced topics.
- Title not available (Why is that?)
- A Block-$LU$ Update for Large-Scale Linear Programming
- Zero-coefficient cuts
- Large sparse numerical optimization
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Some lower bounds on sparse outer approximations of polytopes
- Coordinated cutting plane generation via multi-objective separation
- A probabilistic analysis of the strength of the split and triangle closures
Cited In (24)
- Cutting Plane Generation through Sparse Principal Component Analysis
- A node elimination algorithm for cubature of high-dimensional polytopes
- Sparse PSD approximation of the PSD cone
- Projection onto a polyhedron that exploits sparsity
- A lexicographic pricer for the fractional bin packing problem
- Branch-and-bound solves random binary IPs in poly\((n)\)-time
- Volume computation for sparse Boolean quadric relaxations
- Strong IP formulations need large coefficients
- Theoretical challenges towards cutting-plane selection
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Sparsity of integer formulations for binary programs
- Sparsity of lift-and-project cutting planes
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- How good are sparse cutting-planes?
- Experimental validation of volume-based comparison for double-McCormick relaxations
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Split cuts from sparse disjunctions
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Some lower bounds on sparse outer approximations of polytopes
- Easy and hard separation of sparse and dense odd-set constraints in matching
- Distance-sparsity transference for vertices of corner polyhedra
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
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)
