This work gives an overview over the major codes available for the solution of linear semidefinite (SDP) and second-order cone (SOCP) programs. Some developments since the 7th DIMACS Challenge [9, 17] are pointed out as well as some currently under way. Instead of presenting per- formance tables, reference is made to the ongoing benchmark [19] as well as other related efforts.
Citation
this article was written for the "Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications"