An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486): 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.jmaa.2005.04.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2070416691
@@ Property / OpenAlex ID: W2070416691 / rank @@
+Normal rank
@@ Property / cites work @@
+On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q2773659
@@ Property / cites work: Q2773659 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Q4791754
@@ Property / cites work: Q4791754 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382667
@@ Property / cites work: Q4382667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5309527
@@ Property / cites work: Q5309527 / rank @@
+Normal rank