Abstract
In this paper, we propose an arc-search infeasible-interior-point method based on the wide neighbourhood for linear complementarity problems over symmetric cones with the Cartesian -property (-SCLCP). The algorithm searches the optimizers along the ellipses that approximate the central path. Moreover, we derive the complexity bound of the algorithm which coincides with the currently best known theoretical complexity bounds for the short step path-following algorithm. Some numerical results are provided to demonstrate the computational performance 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
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.