A generalized interior-point barrier function approach for smooth convex programming with linear constraints

References

• den Hertog , D. 1994 . Interior point approach to linear, quadratic and convex programming , The Netherlands : Kluwer Academic Publishers .
   Google Scholar
• Fang , S. C. and Puthenpura , S. 1993 . Linear optimization and extensions — Theory and algorithms , Englewood Cliffs , New Jersey : Prentice Hall .
   Google Scholar
• Jarre , F. 1992 . Interior point methods for convex programming . Applied Mathematics and Optimization , 26 : 287 – 311 .
   Web of Science ®Google Scholar
• Kojima , M. , Mizuno , S. and Yoshise , A. 1989 . “ A primal-dual interior point method for linear programming ” . In Progress in mathematical programming: Interior-point and related methods , Edited by: Megiddo , N. New York : Springer-Verlag . in
   Google Scholar
• Kortanek , K. O. , Potra , F. and Ye , Y. 1991 . On some efficient interior point methods for nonlinear convex programming . Linear Algebra and Its Applications , 152 : 169 – 189 .
   Web of Science ®Google Scholar
• Monteiro , R. D. C. and Adler , I. 1990 . An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence . Mathematics of Operations Research , 15 : 408 – 422 .
   Web of Science ®Google Scholar
• Nesterov , Y. and Nemirovskii , A. 1994 . Interior-point polynomial algorithms in convex programming, SIAM Philadelphia
   Google Scholar
• Roos , C. and Vial , J.-P. 1992 . A polynomial method for approximate center for linear programming . Mathematical Programming , 54 : 295 – 305 .
   Web of Science ®Google Scholar
• Sheu , R. L. and Fang , S. C. 1992 . Insights into the interior points . Zeischrift fur Operations Research , : 227 – 257 .
   Google Scholar
• Sheu , R. L. and Fang , S. C. 1994 . On the generalized path-following methods for linear programming . Optimization , 30 : 235 – 249 .
   Google Scholar
• Vanderbei , R. J. , Meketon , M. S. and Freeman , B. A. 1986 . A modification of Karmarkar’s linear programming algorithm . Algorithmica , 1 : 395 – 407 .
   Web of Science ®Google Scholar
• Zhu , J. 1992 . A path-following algorithm for a class of convex programming problems . Zeischrift fur Operations Research , 36 : 359 – 377 .
   Google Scholar