Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1007/s10559-016-9893-3
-Normal rank
@@ Property / OpenAlex ID @@
-W2554521521
@@ Property / OpenAlex ID: W2554521521 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-016-9893-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2554521521
@@ Property / OpenAlex ID: W2554521521 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4517108
@@ Property / cites work: Q4517108 / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+Q5292090
@@ Property / cites work: Q5292090 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4323601
@@ Property / cites work: Q4323601 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondifferentiable optimization and polynomial problems
+Normal rank
@@ Property / cites work @@
+An approach to determining Shor's dual quadratic estimates
+Normal rank
@@ Property / cites work @@
+On Lagrangian Relaxation of Quadratic Matrix Constraints
+Normal rank
@@ Property / cites work @@
+On the accuracy of dual bounds for quadratic extremum problems
+Normal rank
@@ Property / cites work @@
+Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain
+Normal rank