Skip to main navigation
Skip to search
Skip to main content
Sort by
Mathematics
Approximates
7%
Asymptotic Stability
11%
Convex
38%
Discrete Time
15%
Dynamical System
23%
Feasible Set
5%
Finite Set
5%
Finiteness Property
6%
Globally asymptotically stable
9%
Initial Condition
5%
Joint Spectral Radius
19%
Linear Program
6%
Linear Programming
10%
Linear System
14%
Local Minimum
5%
Matrix (Mathematics)
16%
Polynomial
100%
Polynomial Optimization
6%
Polynomial Time
14%
Positive Definite
7%
Positive Semidefinite Matrix
5%
Quadratic Function
5%
Square Optimization
15%
Square Polynomial
8%
Stability Criteria
6%
Sufficient Condition
16%
Sum of Squares
58%
Upper Bound
10%
Vector Field
26%
Keyphrases
Algebraic Optimization
6%
Algebraic Techniques
6%
All-optical Clock Recovery
8%
Collision Avoidance
6%
Convex Polynomial
9%
Convexity
9%
Discrete-time Switched Systems
5%
Dynamical Systems
11%
Explicit Examples
6%
Globally Asymptotically Stable
5%
Hessian
6%
Homogeneous Polynomials
5%
Homogeneous Vector Fields
8%
Inner Approximation
5%
Joint Spectral Radius
10%
Learning Dynamical Systems
8%
Linear Programming
7%
Local Minima
5%
Lyapunov Analysis
9%
Lyapunov Function
22%
Lyapunov Inequality
5%
Metatheorems
6%
Newton Method
5%
Non-convexity
6%
Non-monotonic Lyapunov Function
6%
Polarization-independent
5%
Polynomial Lyapunov Function
14%
Polynomial Optimization
8%
Polynomial Vector Fields
9%
Second-order Cone Programming
5%
Semidefinite Programming
40%
Stable Polynomial
5%
Sum of Squares
25%
Sum-of-squares Optimization
9%
Sum-of-squares Polynomials
5%
Switched Linear Systems
7%
Switched Systems
10%
Computer Science
Controller Synthesis
8%
discrete-time
11%
Dynamical System
17%
Fundamental Problem
8%
Lyapunov Function
17%
lyapunov theory
9%
Performance Guarantee
8%
Research Effort
12%
Semidefinite Programming
18%
Side Information
8%
Speed-up
8%
Sufficient Condition
5%
Sum-of-Squares Programming
9%
System Analysis
5%
