A method for solving maximum-problems with a nonconcave quadratic objective function (Q5514163): Difference between revisions

@@ Property / author @@
-Klaus Ritter
@@ Property / author: Klaus Ritter / rank @@
-Normal rank
@@ Property / author @@
+Klaus Ritter
@@ Property / author: Klaus Ritter / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3229784
@@ Property / cites work: Q3229784 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514145
@@ Property / cites work: Q5514145 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844780
@@ Property / cites work: Q3844780 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5806966
@@ Property / cites work: Q5806966 / rank @@
+Normal rank
@@ Property / cites work @@
+The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
+Normal rank
@@ Property / cites work @@
+Stationary points of quadratic maximum-problems
@@ Property / cites work: Stationary points of quadratic maximum-problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5331027
@@ Property / cites work: Q5331027 / rank @@
+Normal rank
@@ Property / cites work @@
+The Simplex Method for Quadratic Programming
@@ Property / cites work: The Simplex Method for Quadratic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3277015
@@ Property / cites work: Q3277015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5514163