Recursive algorithms for inner ellipsoidal approximation of convex polytopes.

DOI10.1016/S0005-1098(03)00180-8zbMath1034.93018OpenAlexW1990937445MaRDI QIDQ1413940

Paolo Gay, Fabrizio Dabbene, Boris T. Polyak

Publication date: 17 November 2003

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(03)00180-8

zbMATH Keywords

convex polytopeconstraintsfeasibilityellipsoidal approximation

Mathematics Subject Classification ID

Related Items (4)

Simple approximations of semialgebraic sets and their applications to control ⋮ Probabilistic robust design with linear quadratic regulators ⋮ Research on probabilistic methods for control system design ⋮ Computation of parameter stability margins using polynomial programming techniques

Cites Work

• Parameter estimation algorithms for a set-membership description of uncertainty
• On the value of information in system identification-bounded noise case
• Applications of semidefinite programming
• Convergence properties of the membership set
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• The method of recursive aim inequalities in adaptive control theory
• Linear Matrix Inequalities in System and Control Theory
• Stochastic algorithms for exact and approximate feasibility of robust LMIs
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Probabilistic robust design with linear quadratic regulators
• Multi-input multi-output ellipsoidal state bounding.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive algorithms for inner ellipsoidal approximation of convex polytopes.