1. F. Alizadeh, “Optimization over the positive definite cone: interior-point methods and combinatorial applications,” in: P. Pardalos, ed.,Advances in Optimization and Parallel Computing (North-Holland, Amsterdam, 1992) pp. 1–25.
2. D. den Hertog,Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (Kluwer Academic Publishers, Dordrecht, 1994).
3. D. den Hertog, C. Roos and T. Terlaky, “On the classical logarithmic barrier method for a class of smooth convex programming problems,”Journal of Optimization Theory and Applications 73 (1) (1992) 1–25.
4. R.J. Duffin, E.L. Peterson and C. Zener,Geometric Programming (Wiley, New York, 1967).
5. A.V. Fiacco and G.P. McCormick,Nonlinear Programming, Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).