Reduced vertex set result for interval semidefinite optimization problems
From MaRDI portal
Publication:956611
DOI10.1007/s10957-008-9423-1zbMath1189.90114OpenAlexW2139807505MaRDI QIDQ956611
Publication date: 25 November 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9423-1
Related Items
Robust control of uncertain systems: classical results and recent developments ⋮ A statistical learning theory approach for uncertain linear and bilinear matrix inequalities ⋮ Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities ⋮ Certification of real inequalities: templates and sums of squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A stabilization algorithm for a class of uncertain linear systems
- Applications of semidefinite programming
- Robust solutions of uncertain linear programs
- Several NP-hard problems arising in robust stability analysis
- On minimizing the largest eigenvalue of a symmetric matrix
- A new vertex result for robustness problems with interval matrix uncertainty
- Robust Convex Optimization
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Linear programming with interval coefficients
- Semidefinite optimization
- Robust Solutions to Uncertain Semidefinite Programs
- Positive Definiteness and Stability of Interval Matrices
- Linear Matrix Inequalities in System and Control Theory
- Robust Truss Topology Design via Semidefinite Programming
- Semidefinite Programming
- A survey of computational complexity results in systems and control
