A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
From MaRDI portal
Publication:2443367
Recommendations
Cites work
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Checking robust nonsingularity is NP-hard
- Computational complexity of μ calculation
- Computing bounds for the mixed μ problem
- Continuity properties of the real/complex structured singular value
- Exact calculation of the multiloop stability margin
- scientific article; zbMATH DE number 53583 (Why is no real title available?)
- scientific article; zbMATH DE number 2206649 (Why is no real title available?)
- Lagrange-type functions in constrained optimization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On augmented Lagrangians for optimization problems with a single constraint
- Several NP-hard problems arising in robust stability analysis
- Stability and duality of nonconvex problems via augmented Lagrangian
- Structured singular value approach for systems with parametric uncertainty
- The complex structured singular value
- The modified subgradient algorithm based on feasible values
- The nonlinear and augmented Lagrangians for nonconvex optimization problems with a single constraint
Cited in
(9)- Robust stability clearance of flight control law based on global sensitivity analysis
- scientific article; zbMATH DE number 3978277 (Why is no real title available?)
- A study of the gap between the structured singular value and its convex upper bound for low-rank matrices
- scientific article; zbMATH DE number 6913620 (Why is no real title available?)
- Real structured singular value synthesis using the scaled Popov criterion
- Computation of bifurcation margins based on robust control concepts
- On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound
- A nonlinear programming technique to compute the real structured singular value
- A low rank ODE based technique for numerical approximation of lower bounds of structured singular value
This page was built for publication: A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443367)