Abstract
It is well known that the symmetric cone complementarity problem (SCCP) is a broad class of optimization problems which contains many optimization problems as special cases. Based on a general smoothing function, we propose in this paper a non-interior continuation algorithm for solving the monotone SCCP. The proposed algorithm solves at most one system of linear equations at each iteration. By using the theory of Euclidean Jordan algebras, we show that the algorithm is globally linearly and locally quadratically convergent under suitable assumptions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Acta Mathematicae Applicatae Sinica, English Series
Disclaimer: 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.