Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614): Difference between revisions

@@ Property / cites work @@
+Q4246783
@@ Property / cites work: Q4246783 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-relaxed dual global optimization approach
@@ Property / cites work: Primal-relaxed dual global optimization approach / rank @@
+Normal rank
@@ Property / cites work @@
+On solving a d.c. programming problem by a sequence of linear programs
+Normal rank
@@ Property / cites work @@
+Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
+Normal rank
@@ Property / cites work @@
+Global minimization of indefinite quadratic problems
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+A parallel algorithm for partially separable non-convex global minimization: Linear constraints
+Normal rank
@@ Property / cites work @@
+Convergence of a subgradient method for computing the bound norm of matrices
+Normal rank
@@ Property / cites work @@
+Q3772809
@@ Property / cites work: Q3772809 / rank @@
+Normal rank
@@ Property / cites work @@
+New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
+Normal rank