Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323): Difference between revisions

@@ Property / cites work @@
+Problems of distance geometry and convex properties of quadratic maps
+Normal rank
@@ Property / cites work @@
+A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
+Normal rank
@@ Property / cites work @@
+Local minima and convergence in low-rank semidefinite programming
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
+Normal rank
@@ Property / cites work @@
+Conditions for global optimality. II
@@ Property / cites work: Conditions for global optimality. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
+Normal rank
@@ Property / cites work @@
+First- and second-order methods for semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
+Normal rank