Extension of a projective interior point method for linearly constrained convex programming (Q990634): Difference between revisions

@@ 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.1016/j.amc.2007.03.066
+Normal rank
@@ Property / OpenAlex ID @@
+W2050578491
@@ Property / OpenAlex ID: W2050578491 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's algorithm for linear programming using dual variables
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank