Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422): Difference between revisions

@@ Property / cites work @@
+A New Infinity-Norm Path Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4003375
@@ Property / cites work: Q4003375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583564
@@ Property / cites work: Q5583564 / rank @@
+Normal rank
@@ Property / cites work @@
+Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
+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 @@
+Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Generalized Linear Complementarity Problems
@@ Property / cites work: Generalized Linear Complementarity Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
+Normal rank
@@ Property / cites work @@
+On the classical logarithmic barrier function method for a class of smooth convex programming problems
+Normal rank
@@ Property / cites work @@
+A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q3995706
@@ Property / cites work: Q3995706 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior-point methods for convex programming
@@ Property / cites work: Interior-point methods for convex programming / rank @@
+Normal rank
@@ Property / cites work @@
+Large-Step Interior Point Algorithms for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+An interior point potential reduction algorithm for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A new continuation method for complementarity problems with uniform P- functions
+Normal rank
@@ Property / cites work @@
+Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Global convergence in infeasible-interior-point algorithms
+Normal rank
@@ Property / cites work @@
+On some efficient interior point methods for nonlinear convex programming
+Normal rank
@@ Property / cites work @@
+A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
+Normal rank
@@ Property / cites work @@
+O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
+Normal rank
@@ Property / cites work @@
+A Positive Algorithm for the Nonlinear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+NE/SQP: A robust algorithm for the nonlinear complementarity problem
+Normal rank
@@ Property / cites work @@
+Interior-point methods for nonlinear complementarity problems
+Normal rank
@@ Property / cites work @@
+A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
+Normal rank
@@ Property / cites work @@
+A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Global linear convergence of a path-following algorithm for some monotone variational inequality problems
+Normal rank
@@ Property / cites work @@
+On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
+Normal rank
@@ Property / cites work @@
+A class of linear complementarity problems solvable in polynomial time
+Normal rank
@@ Property / cites work @@
+A path following algorithm for a class of convex programming problems
+Normal rank