Detecting redundancy in optimization problems over intersection of ellipsoids

DOI10.1080/09720502.2002.10700315MaRDI QIDQ4465477zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(1)

• Removing redundant quadratic constraints

Describes a project that uses

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)