The complexity of self-regular proximity based infeasible IPMs (Q2506182): Difference between revisions

@@ Property / DOI @@
-.1007/s10589-005-3064-1
@@ Property / DOI: 10.1007/s10589-005-3064-1 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10589-005-3064-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2024962211
@@ Property / OpenAlex ID: W2024962211 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+Feasibility issues in a primal-dual interior-point method for linear programming
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Q4791754
@@ Property / cites work: Q4791754 / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic large-update primal‐dual interior-point method for linear optimization
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
+Normal rank
@@ Property / cites work @@
+An Infeasible-Interior-Point Method for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Q4250861
@@ Property / cites work: Q4250861 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior point methods of mathematical programming
+Normal rank
@@ Property / cites work @@
+Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+An Infeasible Path-Following Method for Monotone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+An infeasible-interior-point potential-reduction algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+An infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A superquadratic infeasible-interior-point method for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q4382667
@@ Property / cites work: Q4382667 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+User'S guide To Lipsol linear-programming interior point solvers V0.4
+Normal rank
@@ Property / DOI @@
+.1007/S10589-005-3064-1
@@ Property / DOI: 10.1007/S10589-005-3064-1 / rank @@
+Normal rank