The D-decomposition technique for linear matrix inequalities
暂无分享,去创建一个
[1] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[2] Arkadi Nemirovski,et al. Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.
[3] Stephen P. Boyd,et al. Linear Matrix Inequalities in Systems and Control Theory , 1994 .
[4] Laurent El Ghaoui,et al. Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..
[5] Boris T. Polyak. Robust Linear Algebra and Robust Aperiodicity , 2003 .
[6] Y. Pyatnitskiy,et al. Numerical methods of Lyapunov function construction and their application to the absolute stability problem , 1982 .
[7] Arkadi Nemirovski,et al. On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty , 2002, SIAM J. Optim..
[8] Boris T. Polyak,et al. Stability regions in the parameter space: D-decomposition revisited , 2006, Autom..
[9] G. Calafiore. Random walks for probabilistic robustness , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).
[10] W. Kahan,et al. Numerical Linear Algebra , 2020, Fundamentals of Numerical Mathematics for Physicists and Engineers.
[11] Boris Polyak. Convexity of Quadratic Transformations and Its Use in Control and Optimization , 1998 .