Abstract
In this paper, we employ the projection operator to design a semismooth Newton algorithm for solving nonlinear symmetric cone programming (NSCP). The algorithm is computable from theoretical standpoint and is proved to be locally quadratically convergent without assuming strict complementarity of the solution to NSCP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have