Abstract
AbstractThere has been much interest recently in smoothing methods for solving semidefinite programming (SDP). In this paper, based on the equivalent transformation for the optimality conditions of SDP, we present a predictor–corrector smoothing Newton algorithm for SDP. Issues such as the existence of Newton directions, boundedness of iterates, global convergence, and local superlinear convergence of our algorithm are studied under suitable assumptions.
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.