Maximization of a PSD quadratic form and factorization (Q2230781): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-020-01624-w
@@ Property / DOI: 10.1007/s11590-020-01624-w / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-020-01624-w
+Normal rank
@@ Property / OpenAlex ID @@
+W3046976858
@@ Property / OpenAlex ID: W3046976858 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear Programming
@@ Property / cites work: Nonlinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
+Normal rank
@@ Property / cites work @@
+Linear Optimization Problems with Inexact Data
@@ Property / cites work: Linear Optimization Problems with Inexact Data / rank @@
+Normal rank
@@ Property / cites work @@
+Q4833806
@@ Property / cites work: Q4833806 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds on the Radius of Nonsingularity
@@ Property / cites work: Tight Bounds on the Radius of Nonsingularity / rank @@
+Normal rank
@@ Property / cites work @@
+Regularity radius: Properties, approximation and a not a priori exponential algorithm
+Normal rank
@@ Property / cites work @@
+Q3997222
@@ Property / cites work: Q3997222 / rank @@
+Normal rank
@@ Property / cites work @@
+MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE
+Normal rank
@@ Property / cites work @@
+Computational complexity and feasibility of data processing and interval computations
+Normal rank
@@ Property / cites work @@
+Q2864120
@@ Property / cites work: Q2864120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4485695
@@ Property / cites work: Q4485695 / rank @@
+Normal rank
@@ Property / cites work @@
+Methods for Global Concave Minimization: A Bibliographic Survey
+Normal rank
@@ Property / cites work @@
+Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique for solving discrete and continuous nonconvex problems
+Normal rank
@@ Property / cites work @@
+Convex analysis and global optimization
@@ Property / cites work: Convex analysis and global optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137900
@@ Property / cites work: Q3137900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2743981
@@ Property / cites work: Q2743981 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for concave quadratic programming
@@ Property / cites work: A new algorithm for concave quadratic programming / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11590-020-01624-W
@@ Property / DOI: 10.1007/S11590-020-01624-W / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2230781