Answers are grounded in this paper and cite their sources.
Nonlinear semidefinite programming (SDP) problems have received a lot of attentions because of large variety of applications. In this paper, we survey numerical methods for solving nonlinear SDP problems. Three kinds of typical numerical methods are described; augmented Lagrangian methods, sequential SDP methods and primal-dual interior point methods. We describe their typical algorithmic forms and discuss their global and local convergence properties which include rate of convergence.
No takes yet. Share an insight, caveat, or question.
Yamashita et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: