A detailed comparative analysis of μ lower bound algorithms

@article{Fabrizi2014ADC,
  title={A detailed comparative analysis of μ lower bound algorithms},
  author={Andrea Fabrizi and Clement Roos and Jean-Marc Biannic},
  journal={2014 European Control Conference (ECC)},
  year={2014},
  pages={220-226}
}
This paper presents a detailed comparison of the most significant methods developed to compute lower bounds on the structured singular value. The objective is to characterize the behavior of these robustness analysis tools on the basis of a common framework constituted by a wide set of various real-world applications. 
8 Citations
38 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 38 references

A nonsmooth lower bound on ν

  • A. Simões R. Lemos, P. Apkarian
  • International Journal of Robust and Nonlinear…
  • 2014

A nonlinear programming technique to compute a tight lower bound for the real structured singular value

  • A. Karamancıoğlu A. Yazıcı, R. Kasimbeyli
  • Optimization and Engineering
  • 2011

Efficient computation of a guaranteed stability domain for a high - order parameter dependent plant

  • J.-M. Biannic
  • 2010

Stability feeler : a tool for parametric robust stability analysis and its applications

  • T. Mori
  • IET Control Theory & Applications
  • 2009

The modified subgradient algorithm based on feasible values

  • O. Ustun R. Kasimbeyli, A. Rubinov
  • Optimization
  • 2009

State - space μ analysis for an experimental drivebywire vehicle

  • M. Hayes M. Halton, P. Iordanov
  • International Journal of Robust and Nonlinear…
  • 2008

A gainbased lower bound algorithm for real and mixed μ problems

  • E. Gatzke R. Vadigepalli, F. Doyle
  • Proceedings of the 45 th IEEE Conference on…
  • 2006

Similar Papers

Loading similar papers…