Practical issues on the projection of polyhedral sets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4213487 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3557513 (Why is no real title available?)
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A canonical form for generalized linear constraints
- An algorithm for determining all extreme points of a convex polytope
- Degeneracy graphs and the neighbourhood problem
- On Fourier's algorithm for linear arithmetic constraints
- On the structure of the set bases of a degenerate point
Cited in
(11)- Projecting CLP(\({\mathcal R}\)) constraints
- Projection, consistency, and George Boole
- Adjustable robust optimization via Fourier-Motzkin elimination
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Consistency, redundancy, and implied equalities in linear systems
- Wald, QLR, and score tests when parameters are subject to linear inequality constraints
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Indirect adaptive model predictive control and its application to uncertain linear systems
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
This page was built for publication: Practical issues on the projection of polyhedral sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356171)
