Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems

From MaRDI portal
Publication:4006053

DOI10.1002/rnc.4590010404zbMath0759.93036OpenAlexW2130515279MaRDI QIDQ4006053

Venkataramanan Balakrishnan, Silvano Balemi, Stephen P. Boyd

Publication date: 26 September 1992

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rnc.4590010404



Related Items

On convexified robust control synthesis, Unnamed Item, New strategy for robust stability analysis of discrete-time uncertain systems, A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions, Guaranteed analysis and optimisation of parametric systems with application to their stability degree, Methods of multiextremal optimization under constraints for separably quasimonotone functions, Computing the lowest equilibrium pose of a cable-suspended rigid body, A branch-and-bound framework for unsupervised common event discovery, Stability analysis for point delay fractional description models via linear matrix inequalities, Robust switching output-feedback control of time-varying polytopic uncertain systems, Second-order nonsmooth optimization for \(H_{\infty}\) synthesis, Structured singular value approach for systems with parametric uncertainty, Stability analysis with quadratic Lyapunov functions: some necessary and sufficient multiplier conditions, Some applications of a polynomial inequality to global optimization, Branch and bound algorithm with applications to robust stability, Minimizing the object space error for pose estimation: towards the most efficient algorithm, Branch and bound algorithms for maximizing expected improvement functions, Robust stability analysis and dynamic gain-scheduled controller design for point time-delay systems with parametrical uncertainties, The complex structured singular value, Bibliography on robust control, Robust stability using interval analysis, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility



Cites Work