Convexity recognition of the union of polyhedra
From MaRDI portal
Publication:5943314
DOI10.1016/S0925-7721(01)00004-9zbMath0976.68163MaRDI QIDQ5943314
Alberto Bemporad, Komei Fukuda, Fabio D. Torrisi
Publication date: 27 September 2001
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
Explicit sub-optimal linear quadratic regulation with state and input constraints ⋮ Donut Domains: Efficient Non-convex Domains for Abstract Interpretation ⋮ On the efficiency of convex polyhedra ⋮ Time-Bounded Verification of CTMCs against Real-Time Specifications ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ Geometric algorithm for multiparametric linear programming ⋮ An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks ⋮ On a cone covering problem ⋮ On ill-conceived initialization in archetypal analysis ⋮ Random dual expected utility ⋮ Evaluation of piecewise affine control via binary search tree ⋮ Inner and outer approximations of polytopes using boxes. ⋮ An algorithm for approximate multiparametric linear programming ⋮ Computation of the constrained infinite time linear quadratic regulator ⋮ On highly robust efficient solutions to uncertain multiobjective linear programs ⋮ Optimal complexity reduction of polyhedral piecewise affine systems ⋮ A geometric and game-theoretic study of the conjunction of possibility measures ⋮ Convexity recognition of the union of polyhedra ⋮ Exact join detection for convex polyhedra and other numerical abstractions ⋮ A case when the union of polytopes is convex ⋮ Extended convex hull ⋮ The explicit linear quadratic regulator for constrained systems ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Stabilizing low complexity feedback control of constrained piecewise affine systems
Uses Software
Cites Work
