Detecting redundancy in optimization problems over intersection of ellipsoids
From MaRDI portal
Publication:4465477
DOI10.1080/09720502.2002.10700315zbMath1048.90140OpenAlexW2326863594MaRDI QIDQ4465477
Publication date: 9 June 2004
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2002.10700315
Uses Software
Cites Work
- Approximation algorithms for quadratic programming
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- On maximization of quadratic form over intersection of ellipsoids with common center
- Determinant Maximization with Linear Matrix Inequality Constraints
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
- Semidefinite Programming
- Rounding of Polytopes in the Real Number Model of Computation