Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
From MaRDI portal
Recommendations
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
- Minimizing Piecewise-Concave Functions Over Polyhedra
- An affine scaling method for optimization problems with polyhedral constraints
- Simplicial algorithms for minimizing polyhedral functions
- A unifying polyhedral approximation framework for convex optimization
- An efficient algorithm for minimizing a multivariate polyhedral function along a line
- Optimization and approximation for polyhedra in separable Hilbert spaces
- Polyhedral functions and multiparametric linear programming
- scientific article; zbMATH DE number 1305444
- scientific article; zbMATH DE number 1537598
Cited in
(10)- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Speeding up polyhedral analysis by identifying common constraints
- Efficient elimination of redundancies in polyhedra by raytracing
- scientific article; zbMATH DE number 2090856 (Why is no real title available?)
- Static Analysis
- An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection
- Revisiting polyhedral analysis for hybrid systems
- Efficient detection of redundancies in systems of linear inequalities
- Efficient detection of redundancies in systems of linear inequalities
- Some ways to reduce the space dimension in polyhedra computations
This page was built for publication: Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233243)
