Abstract
We present an inexact smoothing method for the monotone complementarity problem over symmetric cones (SCCP). Our algorithm needs only to solve one linear system of equation and perform one line search per iteration. Instead of solving the linear equation exactly, we only need an inexact solution with a certain degree of accuracy. It is shown that any accumulation point of generated sequence is a solution of SCCP. It is proved that the proposed algorithm is locally superlinearly/quadratically convergent under suitable conditions. The computational results show the feasibility and efficiency of our algorithm.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
