A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064): Difference between revisions

@@ Property / author @@
+Dianne P. O'Leary
@@ Property / author: Dianne P. O'Leary / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C22
@@ Property / Mathematics Subject Classification ID: 90C22 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C51
@@ Property / Mathematics Subject Classification ID: 90C51 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6480824
@@ Property / zbMATH DE Number: 6480824 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semidefinite programming
@@ Property / zbMATH Keywords: semidefinite programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+interior point methods
@@ Property / zbMATH Keywords: interior point methods / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constraint reduction
@@ Property / zbMATH Keywords: constraint reduction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+primal dual infeasible
@@ Property / zbMATH Keywords: primal dual infeasible / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial complexity
@@ Property / zbMATH Keywords: polynomial complexity / rank @@
+Normal rank

Revision as of 22:16, 30 June 2023