Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891): Difference between revisions

@@ Property / author @@
+Panos M. Pardalos
@@ Property / author: Panos M. Pardalos / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939008843615
+Normal rank
@@ Property / OpenAlex ID @@
+W1978344132
@@ Property / OpenAlex ID: W1978344132 / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of quadratic programs
@@ Property / cites work: On a class of quadratic programs / rank @@
+Normal rank
@@ Property / cites work @@
+The simplex method. A probabilistic analysis
@@ Property / cites work: The simplex method. A probabilistic analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A note on a quadratic formulation for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Global minimization of indefinite quadratic problems
+Normal rank
@@ Property / cites work @@
+Global Optimization Approach to the Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+Checking local optimality in constrained quadratic programming is NP- hard
+Normal rank
@@ Property / cites work @@
+Karmarkar's algorithm and the ellipsoid method
@@ Property / cites work: Karmarkar's algorithm and the ellipsoid method / rank @@
+Normal rank