Abstract
The symmetric cone complementarity problem (denoted by SCCP) is a class of equilibrium optimization problems, and it contains the standard linear/nonlinear complementarity problem (LCP/NCP), the second-order cone complementarity problem (SOCCP) and the semidefinite complementarity problem (SDCP) as special cases. In this paper, we present a regularized smoothing Newton algorithm for SCCP by making use of Euclidean Jordan algebraic technique. Under suitable conditions, we obtain global convergence and local quadratic convergence of the proposed algorithm. Some numerical results are reported in this paper, which confirm the good theoretical properties of the proposed 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.
