Abstract
We propose an infeasible Mehrotra-type predictor-corrector algorithm with a new center parameter updating scheme for Cartesian P *(κ)-linear complementarity problem over symmetric cones. Based on the Nesterov-Todd direction, we show that the iteration-complexity bound of the proposed algorithm is 𝒪((1 + κ)3 r 2log ε−1), where r is the rank of the associated Euclidean Jordan algebras and κ is the handicap of the problem and ε > 0 is the required precision. Some numerical results are reported as well.
Sign-in/Register to access full text options 
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.
