1. E.D. Andersen, MOSEK: high performance software for large-scale LP, QP, SOCP, SDP and MIP (1997). http://www.mosek.com/
2. E.D. Andersen, Y. Ye, On a homogeneous algorithm for the monotone complementarity problem. Math. Prog. 84, 375–400 (1999)
3. K.M. Anstreicher, D. den Hertog, C. Roos, T. Terlaky, A long step barrier method for convex quadratic programming. Algorithmica 10, 365–382 (1993)
4. K.J. Arrow, L. Hurwicz, Gradient method for concave programming, I.: local results, in Studies in Linear and Nonlinear Programming, ed. by K.J. Arrow, L. Hurwicz, H. Uzawa (Stanford University Press, Stanford, 1958)
5. E.M.L. Beale, in Numerical Methods, Nonlinear Programming, ed. by J. Abadie (North-Holland, Amsterdam, 1967)