Detecting redundancy in optimization problems over intersection of ellipsoids (Q4465477): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720502.2002.10700315 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2326863594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-one LMI approach to simultaneous stabilization of linear systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding of Polytopes in the Real Number Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximization of quadratic form over intersection of ellipsoids with common center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinant Maximization with Linear Matrix Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Latest revision as of 17:44, 6 June 2024

scientific article; zbMATH DE number 2071327
Language Label Description Also known as
English
Detecting redundancy in optimization problems over intersection of ellipsoids
scientific article; zbMATH DE number 2071327

    Statements

    Identifiers