Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1007/s10898-018-0676-4
-Normal rank
@@ Property / OpenAlex ID @@
-W2809623894
@@ Property / OpenAlex ID: W2809623894 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-018-0676-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2809623894
@@ Property / OpenAlex ID: W2809623894 / rank @@
+Normal rank
@@ Property / cites work @@
+Complementarity and nondegeneracy in semidefinite programming
+Normal rank
@@ Property / cites work @@
+On Lagrangian Relaxation of Quadratic Matrix Constraints
+Normal rank
@@ Property / cites work @@
+A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
+Normal rank
@@ Property / cites work @@
+Q2928409
@@ Property / cites work: Q2928409 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5148358
@@ Property / cites work: Q5148358 / rank @@
+Normal rank
@@ Property / cites work @@
+A robust Lagrangian-DNN method for a class of quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+A fresh CP look at mixed-binary QPs: new formulations and relaxations
+Normal rank
@@ Property / cites work @@
+On copositive programming and standard quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
+Normal rank
@@ Property / cites work @@
+On the copositive representation of binary and continuous nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+Approximation of the Stability Number of a Graph via Copositive Programming
+Normal rank
@@ Property / cites work @@
+Q3843714
@@ Property / cites work: Q3843714 / rank @@
+Normal rank
@@ Property / cites work @@
+Binary quadratic optimization problems that are difficult to solve by conic relaxations
+Normal rank
@@ Property / cites work @@
+A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
+Normal rank
@@ Property / cites work @@
+A Copositive Programming Approach to Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Copositive and semidefinite relaxations of the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Bounds for the quadratic assignment problem using the bundle method
+Normal rank
@@ Property / cites work @@
+Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
+Normal rank
@@ Property / cites work @@
+Q3802887
@@ Property / cites work: Q3802887 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving semidefinite-quadratic-linear programs using SDPT3
+Normal rank
@@ Property / cites work @@
+SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for the quadratic assignment problem
+Normal rank