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

DOI10.1007/s11081-010-9120-4zbMath1284.70046OpenAlexW1972663863MaRDI QIDQ2443367

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

Publication date: 7 April 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-010-9120-4

zbMATH Keywords

robust controlnonlinear programmingreal structured singular valuemodified subgradient algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Control of mechanical systems (70Q05)

Related Items (3)

A low rank ODE based technique for numerical approximation of lower bounds of structured singular value ⋮ Computation of Bifurcation Margins Based on Robust Control Concepts ⋮ Robust stability clearance of flight control law based on global sensitivity analysis

Cites Work

• Several NP-hard problems arising in robust stability analysis
• Stability and duality of nonconvex problems via augmented Lagrangian
• Lagrange-type functions in constrained optimization
• On augmented Lagrangians for optimization problems with a single constraint
• The complex structured singular value
• Checking robust nonsingularity is NP-hard
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
• Structured singular value approach for systems with parametric uncertainty
• Exact calculation of the multiloop stability margin
• Continuity properties of the real/complex structured singular value
• Computational complexity of μ calculation
• Computing bounds for the mixed μ problem
• The modified subgradient algorithm based on feasible values
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value