Abstract
We propose a combined Newton method for solving the symmetric conic linear programming based on the Chen-Harker-Kanzow-Smale smoothing function. The proposed algorithm combines the techniques used in both non-smoothing Newton methods and smoothing Newton methods. Under mild assumptions, the algorithm needs to perform at most one line search at each iteration and is shown to possess global convergence.
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.
