1. Peterson, E.L., and Ecker, J.G., Geometric Programming:Duality in Quadratic Programming and l p -Approximation, I, Proceedings of the International Symposium on Mathematical Programming, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, pp. 445-480, 1970.
2. Peterson, E.L., and Ecker, J.G., Geometric Programming: Duality in Quadratic Programming and l p -Approximation, II, SIAM Journal on Applied Mathematics, Vol. 13, pp. 317-340, 1967.
3. Peterson, E.L., and Ecker, J.G., Geometric Programming: Duality in Quadratic Programming and l p -Approximation, III, Journal of Mathematical Analysis and Applications, Vol. 29, pp. 365-383, 1970.
4. Terlaky, T., On l p -Programming, European Journal of Operational Research, Vol. 22, pp. 70-100, 1985.
5. Nesterov, Y.E., and Nemirovski, A.S., Interior-Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics, SIAM Publications, Philadelphia, Pennsylvania, 1994.