A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C25
@@ Property / Mathematics Subject Classification ID: 90C25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C26
@@ Property / Mathematics Subject Classification ID: 90C26 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6562688
@@ Property / zbMATH DE Number: 6562688 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linearly constrained quadratic optimization problems with complementarity constraints
+Normal rank
@@ Property / zbMATH Keywords @@
+Lagrangian-conic relaxation
@@ Property / zbMATH Keywords: Lagrangian-conic relaxation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bisection method
@@ Property / zbMATH Keywords: bisection method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+iterative solver
@@ Property / zbMATH Keywords: iterative solver / rank @@
+Normal rank

Revision as of 13:53, 27 June 2023