| Nesterov Y E, Nemirovsky A S. Interior point polynomial algorithms in convex programming [J]. SIAM Studies in Applied Mathematics, 1994, 13. Alizadeh E. Optimization over the positive definite cone: interior-point methods and combinatorial applications [M]//Advances in Optimization and Parallel Computing, New York: Elsevier Science Inc, 1992. Lustig I J, Mal'sten R E, Shanno D E. On implementing Mehrotra's predictor-corrector interior point method for linear programming [J]. SIAM Journal on Optimization, 1992, 2: 435-449. Han C G, Pardalos E M, Ye Y. On interior-point algorithms for some entropy optimization problems [R]. Technical Report CS 91-02, Computer Science Department, Pennsylvania State University, Pennsylvania: University Park, PA, 1991. Kortanek K O, No H. A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier [J]. Optimization, 1990, 23: 501-507. Peterson E L, Ecker J G. Geometric programming: duality in quadratic programming and i_p approximation I [C]//Proceedings of the International Symposium of Mathematical Programming. Princeton: Princeton University Press, 1970, 445-479. Peterson E L, Ecker J G. Geometric programming: duality in quadratic programming and i_p approximation II [J]. SIAM Journal on Applied Mathematics}, 1969, {\bf 17}: 317-340. Peterson E L, Eeker J G. Geometric programming: duality in quadratic programming and i_p approximation III [J]. Journal of Mathematical Analysis and Applications}, 1970, {\bf 29}: 365-383. Kortanek K O, Zhu J. A polynomial barrier algorithm for linearly constrained convex programming problems [J]. Mathematics of Operations Research, 1993, 18: 116-128. Zhu J. A path following algorithm for a class of convex programming problems [J]. Zeitschrift fur Operations Research, 1992, 36(4): 359-377. Glineur F. Topics in convex optimization: interior-point methods, conic deality and approximations [D]. Belgium: U Mons, 2001. Ye Y. Interior algorithms for linear quadratic and linearly constrained convex programming [D]. San Francisco: Stanford University, 1987. Zhang S. A new self-dual embedding method for convex programming [J]. Journal of Global Optimization, 2004, 29: 479-496. Gao Yuetian, Wu Donghua. A new self-concordant function method for some classes of structured convex programming problems [J]. Applied Mathematical Sciences. Monteiro R D C, Adler I. An extension of Karmarkar type algorithms to a class of convex separable programming problems with global rate of convergence [J]. Mathematics of Operations Research, 1989, 15(3): 408-422. Mehrotra S, Sun J. An interior point algoritbm for solving smooth convex programs based on Newton's method [J]. Contemporary Mathematics, 1990, 114: 265-284. |
