Abstract
In this paper, we present a smoothing Newton method for solving the second-order cone programming (SOCP) based on the Chen–Harker–Kanzow–Smale (CHKS) smoothing function. Our smoothing method reformulates SOCP as a nonlinear system of equations and then applies Newton’s method to the system. The proposed method solves only one linear system of equations and performs only one line search at each iteration. It is shown that the method is globally and locally sub-quadratically convergent under a nonsingularity assumption. Numerical results suggest that the method is promising.
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.
