Optimization and Engineering

, Volume 12, Issue 3, pp 445–458 | Cite as

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

  • Ahmet Yazıcı
  • Abdurrahman Karamancıoğlu
  • Refail Kasimbeyli


The real structured singular value (RSSV, or real μ) is a useful measure to analyze the robustness of linear systems subject to structured real parametric uncertainty, and surely a valuable design tool for the control systems engineers. We formulate the RSSV problem as a nonlinear programming problem and use a new computation technique, F-modified subgradient (F-MSG) algorithm, for its lower bound computation. The F-MSG algorithm can handle a large class of nonconvex optimization problems and requires no differentiability. The RSSV computation is a well known NP hard problem. There are several approaches that propose lower and upper bounds for the RSSV. However, with the existing approaches, the gap between the lower and upper bounds is large for many problems so that the benefit arising from usage of RSSV is reduced significantly. Although the F-MSG algorithm aims to solve the nonconvex programming problems exactly, its performance depends on the quality of the standard solvers used for solving subproblems arising at each iteration of the algorithm. In the case it does not find the optimal solution of the problem, due to its high performance, it practically produces a very tight lower bound. Considering that the RSSV problem can be discontinuous, it is found to provide a good fit to the problem. We also provide examples for demonstrating the validity of our approach.


Robust control Real structured singular value Nonlinear programming Modified subgradient algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Azimov AY, Gasimov RN (2002) Stability and duality of nonconvex problems via augmented Lagrangian. Cybern Syst Anal 38:412–421 MATHCrossRefMathSciNetGoogle Scholar
  2. Braatz RP, Young PM, Doyle JC, Morari M (1994) Computational complexity of mu calculation. IEEE Trans Autom Control 39:1000–1002 MATHCrossRefMathSciNetGoogle Scholar
  3. Burachik RS, Gasimov RN, Ismayilova NA, Kaya CY (2006) On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian. J Glob Optim 34:55–78 MATHCrossRefMathSciNetGoogle Scholar
  4. de Gaston RRE, Safonov MG (1988) Exact calculation of the multiloop stability margin. IEEE Trans Autom Control 33:156–171 MATHCrossRefGoogle Scholar
  5. Ferris MC (2006) MATLAB and GAMS: Interfacing, optimization, and visualization software.
  6. Gasimov RN (2002) Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming. J Glob Optim 24:187–203 MATHCrossRefMathSciNetGoogle Scholar
  7. Gasimov RN, Rubinov AM (2004) On augmented Lagrangians for optimization problems with a single constraint. J Glob Optim 28:153–173 MATHCrossRefMathSciNetGoogle Scholar
  8. Gatley SL, Bates DG, Hayes MJ, Postletwaite I (2002) Robustness analysis of an integrated flight and propulsion control system using mu and the v-gap metric. Control Eng Pract 10:261–275 CrossRefGoogle Scholar
  9. Ge ZM, Chu LW (2000) An interval method for computing the stability margin of real uncertainty problems. Opt Control Appl Methods 21:185–193 MATHCrossRefMathSciNetGoogle Scholar
  10. Hayes MJ, Bates DG, Postletwaite I (2001) New tools for computing tight bounds on the real structured singular value. J Guid Control Dyn 24:1204–1213 CrossRefGoogle Scholar
  11. Kasimbeyli R, Ustun O, Rubinov AM (2009) The modified subgradient algorithm based on feasible values. Optimization 58(5):535–560 MATHCrossRefMathSciNetGoogle Scholar
  12. Nemirovskii A (1993) Several NP hard problems arising in robust stability analysis. Math Control Signals Syst 6:99–105 MATHCrossRefMathSciNetGoogle Scholar
  13. Ogata K (1990) Modern control engineering. Prentice-Hall, New York MATHGoogle Scholar
  14. Packard A, Pandey P (1993) Continuity properties of the real/complex structured singular value. IEEE Trans Autom Control 38:415–428 MATHCrossRefMathSciNetGoogle Scholar
  15. Packard A, Doyle J (1993) The complex structured singular value. Automatica 29:71–109 MATHCrossRefMathSciNetGoogle Scholar
  16. Poljak S, Rohn J (1993) Checking robust nonsingularity is NP hard. Math Control Signals Syst 6:1–9 MATHCrossRefMathSciNetGoogle Scholar
  17. Rockafellar RT, Wets RJB (1998) Variational analysis. Springer, Berlin MATHCrossRefGoogle Scholar
  18. Rubinov AM, Gasimov RN (2002) The nonlinear and augmented Lagrangians for nonconvex optimization problems with a single constraint. Appl Comput Math 1:142–157 MATHMathSciNetGoogle Scholar
  19. Rubinov AM, Yang XQ, Bagirov AM, Gasimov RN (2003) Lagrange-type functions in constrained optimization. J Math Sci 115:2437–2505 CrossRefMathSciNetGoogle Scholar
  20. Young PM, Newlin MP, Doyle JC (1995) Computing bounds for the mixed mu problem. Int J Robust Nonlinear Control 5:573–590 MATHCrossRefMathSciNetGoogle Scholar
  21. Young PM (2001) Structured singular value approach for systems with parametric uncertainty. Int J Robust Nonlinear Control 11:653–680 MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Ahmet Yazıcı
    • 1
  • Abdurrahman Karamancıoğlu
    • 2
  • Refail Kasimbeyli
    • 3
  1. 1.Computer Engineering DepartmentOsmangazi UniversityEskişehirTurkey
  2. 2.Electrical Engineering DepartmentOsmangazi UniversityEskişehirTurkey
  3. 3.Department of Industrial Systems EngineeringIzmir University of EconomicsIzmirTurkey

Personalised recommendations