Pages that link to "Item:Q1421455"

The following pages link to Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (Q1421455):

Displaying 8 items.

• Modified equations for weakly convergent stochastic symplectic schemes via their generating functions (Q329031) (← links)
• Guaranteed cost regulator design: a probabilistic solution and a randomized algorithm (Q869082) (← links)
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities (Q875498) (← links)
• Randomized algorithms for quadratic stability of quantized sampled-data systems (Q1879595) (← links)
• A survey of randomized algorithms for control synthesis and performance verification (Q2371305) (← links)
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
• A primal--dual probabilistic setting for quadratic stability of uncertain systems (Q2503603) (← links)
• Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966130) (← links)