Avtomatika i TelemekhanikaIssue 11Semidefinite Relaxation and New Conditions for Sign-Definiteness of the Quadratic Form under Quadratic Constraints
views: 1204
Readers community rating: votes 0
1. Gelig A.Kh., Leonov G.A., Yakubovich V.A. Ustojchivost' nelinejnykh sistem s needinstvennym sostoyaniem ravnovesiya. M.: Nauka, 1978.
2. Polyak B.T., Scherbakov P.S. Robastnaya ustojchivost' i upravlenie. M.: Nauka, 2002.
3. Yakubovich V.A. S-protsedura v nelinejnoj teorii upravleniya // Vestn. LGU. 1971. № 1. S. 62–77. Leningrad: Izd-vo LGU.
4. Polyak B.T. Convexity of Quadratic Transformations and its Use in Control and Optimization // J. Optim. Theory App. 1998. V. 99. No. 3. P. 553–583. 157
5. Polik I., Terlaky T. A Survey of the S-Lemma // SIAM Review. 2007. V. 49. No. 3. P. 371–418.
6. Balakrishnan V., Vanderberghe L. Semidefinite Programming Duality and Linear Time-Invariant Systems // IEEE Trans. Automat. Contr. 2003. V. 48. No. 1. P. 30–41.
7. Ibaraki S., Tomizuka M. Rank Minimization Approach for Solving BMI Problems with Random Search // Proc. Amer. Control Conf. Arlington. 2001. P. 25–27.
8. Henrion D., Meinsma G. Rank-one LMIs and Lyapunov’s Inequality // Proc. 39th IEEE Conf. on Decision and Control. Sydney, Australia. Dec. 2000. P. 1483–1488.
9. Polyak B., Gryazina E. Convexity/Nonconvexity Certificates for Power Flow Analysis // Advances in Energy System Optimization. Proc. 1st Int. Sympos. on Energy Syst. Optim. Springer Int. Publishing AG. 2017. P. 221–230.
