On zero duality gap in nonconvex quadratic programming problems (Q421278): Difference between revisions

@@ Property / author @@
+H. S. Yoon
@@ Property / author: H. S. Yoon / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C26
@@ Property / Mathematics Subject Classification ID: 90C26 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C46
@@ Property / Mathematics Subject Classification ID: 90C46 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6038113
@@ Property / zbMATH DE Number: 6038113 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nonconvex quadratic program
@@ Property / zbMATH Keywords: nonconvex quadratic program / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Lagrangian dual
@@ Property / zbMATH Keywords: Lagrangian dual / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+SDP relaxation
@@ Property / zbMATH Keywords: SDP relaxation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+duality gap
@@ Property / zbMATH Keywords: duality gap / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sufficient conditions
@@ Property / zbMATH Keywords: sufficient conditions / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cell enumeration
@@ Property / zbMATH Keywords: cell enumeration / rank @@
+Normal rank

Revision as of 20:44, 29 June 2023