Low-rank exploitation in semidefinite programming for control

DOI10.1080/00207179.2011.631148MaRDI QIDQ3119148zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

interior point methodslinear matrix inequalitiesmodeling softwareoptimizationsemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Computational enhancements in low-rank semidefinite programming
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Solving rank-constrained semidefinite programs in exact arithmetic

Cites work

• A cutting plane method for solving KYP-SDPs
• A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
• Affine parameter-dependent Lyapunov functions and real parametric uncertainty
• Algorithm 875
• An Extension to Balanced Truncation With Application to Structured Model Reduction
• An inexact interior-point method for system analysis
• An Interior-Point Method for Semidefinite Programming
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear Matrix Inequalities in System and Control Theory
• LPV system analysis via quadratic separator for uncertain implicit systems
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Solving semidefinite-quadratic-linear programs using SDPT3
• Specialized fast algorithms for IQC feasibility and optimization problems.
• System analysis via integral quadratic constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(4)

• A decomposition algorithm for KYP-SDPs
• LQG Control With Minimum Directed Information: Semidefinite Programming Approach
• Sampling method for semidefinite programmes with non-negative Popov function constraints
• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization

Describes a project that uses

Uses Software

• DSDP5
• STRUL
• SeDuMi
• SDPT3
• YALMIP
• LMI toolbox
• COMPleib

This page was built for publication: Low-rank exploitation in semidefinite programming for control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119148)