Quantified constraints under perturbation
From MaRDI portal
Recommendations
- Approximate quantified constraint solving by cylindrical box decomposition
- Efficient solving of quantified inequality constraints over the real numbers
- Stability for linearly constrained optimization problems
- First order perturbation and local stability of parametrized systems
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
Cites work
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1252488 (Why is no real title available?)
- scientific article; zbMATH DE number 1028817 (Why is no real title available?)
- scientific article; zbMATH DE number 1064109 (Why is no real title available?)
- scientific article; zbMATH DE number 2080299 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1543332 (Why is no real title available?)
- scientific article; zbMATH DE number 2090047 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 903747 (Why is no real title available?)
- scientific article; zbMATH DE number 1440926 (Why is no real title available?)
- scientific article; zbMATH DE number 3345438 (Why is no real title available?)
- scientific article; zbMATH DE number 3392404 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Algebraic approach to the interval linear static identification, tolerance, and control problems, or one more application of Kaucher arithmetic
- Applying Linear Quantifier Elimination
- Applying Quantifier Elimination to Stability Analysis of Difference Schemes
- Approximate quantified constraint solving by cylindrical box decomposition
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Guaranteed tuning, with application to robust control and motion planning
- Nonlinear control system design by quantifier elimination
- On a generalization of quantifiers
- Partial cylindrical algebraic decomposition for quantifier elimination
- Pseudofactors of multivariate polynomials
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Quantifier elimination in applied mechanics problems with cylindrical algebraic decomposition
- Quasi-gcd computations
- Reasoning over networks by symbolic methods
- Regularization methods for the stable solution of inverse problems
- Robust analysis and design of control systems using interval arithmetic
- Robust multi-objective feedback design by quantifier elimination
- Testing stability by quantifier elimination
Cited in
(9)- Relating syntactic and semantic perturbations of hybrid automata
- Quantified Constraints and Containment Problems
- Safety verification of non-linear hybrid systems is quasi-decidable
- Contractor programming
- scientific article; zbMATH DE number 2080299 (Why is no real title available?)
- scientific article; zbMATH DE number 1543332 (Why is no real title available?)
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Convergent approximate solving of first-order constraints by approximate quantifiers
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
This page was built for publication: Quantified constraints under perturbation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600045)
