A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
Open Access
- 1 December 2019
- journal article
- research article
- Published by Elsevier BV in EURO Journal on Computational Optimization
- Vol. 7 (4), 359-380
- https://doi.org/10.1007/s13675-019-00116-6
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrixMathematical Programming, 2011
- Inexact semismooth Newton methods for large-scale complementarity problemsOptimization Methods and Software, 2004
- A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control ProblemsSIAM Journal on Optimization, 2000
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniquesMathematical Programming, 1999
- Some Noninterior Continuation Methods for Linear Complementarity ProblemsSIAM Journal on Matrix Analysis and Applications, 1996
- A Non-Interior-Point Continuation Method for Linear Complementarity ProblemsSIAM Journal on Matrix Analysis and Applications, 1993
- A unified approach to interior point algorithms for linear complementarity problems: A summaryOperations Research Letters, 1991
- Computational complexity of complementary pivot methodsPublished by Springer Science and Business Media LLC ,1978
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- Minimization of functions having Lipschitz continuous first partial derivativesPacific Journal of Mathematics, 1966