A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/1055678021000090024
+Normal rank
@@ Property / OpenAlex ID @@
+W2022003008
@@ Property / OpenAlex ID: W2022003008 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Path-Following Methods for Linear Programming
@@ Property / cites work: Path-Following Methods for Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for linear programming based on the logarithmic barrier method
+Normal rank
@@ Property / cites work @@
+Q4692623
@@ Property / cites work: Q4692623 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+A new class of polynomial primal-dual methods for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank