Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C57
@@ Property / Mathematics Subject Classification ID: 90C57 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6087670
@@ Property / zbMATH DE Number: 6087670 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial programs
@@ Property / zbMATH Keywords: polynomial programs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reformulation-linearization technique
@@ Property / zbMATH Keywords: reformulation-linearization technique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semidefinite programming
@@ Property / zbMATH Keywords: semidefinite programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+BARON
@@ Property / zbMATH Keywords: BARON / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+GloptiPoly
@@ Property / zbMATH Keywords: GloptiPoly / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semidefinite cuts
@@ Property / zbMATH Keywords: semidefinite cuts / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+global optimization
@@ Property / zbMATH Keywords: global optimization / rank @@
+Normal rank

Revision as of 11:02, 30 June 2023