Detecting redundancy in optimization problems over intersection of ellipsoids

DOI10.1080/09720502.2002.10700315zbMATH Open1048.90140OpenAlexW2326863594MaRDI QIDQ4465477FDOQ4465477

Shafiu Jibrin

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

Recommendations

• Identifying redundant linear constraints in systems of linear matrix inequality constraints
• Removing redundant quadratic constraints
• scientific article; zbMATH DE number 1163814
• Combinatorial redundancy detection
• Combinatorial redundancy detection

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Cites Work

• Semidefinite Programming
• Rounding of Polytopes in the Real Number Model of Computation
• On maximization of quadratic form over intersection of ellipsoids with common center
• Rank-one LMI approach to simultaneous stabilization of linear systems.
• Determinant Maximization with Linear Matrix Inequality Constraints
• Approximation algorithms for quadratic programming
• Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints

Uses Software

• Sdpsol

This page was built for publication: Detecting redundancy in optimization problems over intersection of ellipsoids

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