Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- 1 November 1992
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 75 (2) , 265-279
- https://doi.org/10.1007/bf00941467
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov functionMathematical Programming, 1992
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of ConvergenceMathematics of Operations Research, 1990
- An interior point algorithm for solving smooth convex programs based on Newton’s methodPublished by American Mathematical Society (AMS) ,1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968