1. F. Alizadeh, J-P.A. Haeberly and M.L. Overton (1994), A new primal-dual interior-point method for semidefinite programming, in J.G. Lewis, ed., Proceedings of the Fifth SIAM Conference on Applied Linear Algebra, SIAM, pp. 113–117.
2. F. Alizadeh, J-P.A. Haeberly and M.L. Overton (1997), Complementarity and nondegeneracy in semidefinite programming, Math. Programming, 77, pp. 111–128.
3. M. Anjos and H. Wolkowicz (1999), A strengthened SDP relaxation via a second lifting for the Max-Cut problem, Technical Report Research Report, CORR 99–55, University of Waterloo, Waterloo, Canada.
4. K.M. Anstreicher (1999), Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem, Technical report, University of Iowa, Iowa City, IA.
5. K.M. Anstreicher, X. Chen, H. Wolkowicz and Y. Yuan (1999), Strong duality for a trust-region type relaxation of QAP, Linear Algebra Appl., 301, pp. 121–136.