Low-rank exploitation in semidefinite programming for control
From MaRDI portal
Publication:3119148
DOI10.1080/00207179.2011.631148zbMath1236.90090MaRDI QIDQ3119148
No author found.
Publication date: 7 March 2012
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56215
optimization; linear matrix inequalities; semidefinite programming; interior point methods; modeling software
90C22: Semidefinite programming
Related Items
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- Specialized fast algorithms for IQC feasibility and optimization problems.
- A cutting plane method for solving KYP-SDPs
- Lectures on Modern Convex Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Algorithm 875
- An inexact interior-point method for system analysis
- Linear Matrix Inequalities in System and Control Theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- System analysis via integral quadratic constraints
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- LPV system analysis via quadratic separator for uncertain implicit systems
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- An Interior-Point Method for Semidefinite Programming
- Affine parameter-dependent Lyapunov functions and real parametric uncertainty
- A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
- An Extension to Balanced Truncation With Application to Structured Model Reduction
