The Square-Newton iteration for linear complementarity problem
Filomat, Tome 37 (2023) no. 2, p. 467
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
For getting the numerical solution of the linear complementary problem (LCP), there are many methods such as the modulus-based matrix splitting iteration and the modulus-based nonsmooth Newton's method. We proposed the Square-Newton method to solve the LCP. This method could solve LCP efficiently. We gave the theoretical analysis and numerical experiments in the paper.
Classification :
98C53
Keywords: Square-Newton iteration, Linear complementarity problem, Quadratic convergence
Keywords: Square-Newton iteration, Linear complementarity problem, Quadratic convergence
Mei Feng; Xiang Wang; Teng Wang. The Square-Newton iteration for linear complementarity problem. Filomat, Tome 37 (2023) no. 2, p. 467 . doi: 10.2298/FIL2302467F
@article{10_2298_FIL2302467F,
author = {Mei Feng and Xiang Wang and Teng Wang},
title = {The {Square-Newton} iteration for linear complementarity problem},
journal = {Filomat},
pages = {467 },
year = {2023},
volume = {37},
number = {2},
doi = {10.2298/FIL2302467F},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2302467F/}
}
Cité par Sources :