Abstract
We consider a Newton-type method for the solution of semidefinite programs. This Newton-type method is based on a semismooth reformulation of the semidefinite program as a nonsmooth system of equations. We establish local quadratic convergence of this method under a linear independence assumption and a weak nondegeneracy condition that implies uniqueness of the optimal solution but does not imply strict complementarity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
