Abstract
This paper presents a Mehrotra-type predictor–corrector algorithm for monotone nonlinear complementarity problems over symmetric cones. The proposed algorithm is a second-order predictor–corrector interior point algorithm. Based on a one-norm wide neighbourhood, the iteration complexity of the algorithm is estimated and some numerical results are provided. The numerical results show that the algorithm is efficient and reliable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
