References
- Bazaraa , M.S. and Shetty , C.M. 1979 . Nonlinear Programming, Theory and Alqorithms , New York : Wiley .
- Fiacco , A.V. 1967 . Sequential Unconstrained Minimization Method For Nonliner Programming , Evanston, Illinois : Northwestern University . Ph.D. Dissertation
- Fiacco A. V. Liu J. Extensions of Algorithmic Sensitivity Calculations in Nonlinear Programming Using Barrier and Penalty Functions 1994 Accepted for publication in Optimization
- Fiacco , A.V. and McCormick , G.P. 1968 . Nonlinear Programming, Sequential Unconstrained Minimization Techniques , New York : Wiley . An unabridged corrected version was published by SIAM in the series Classics in Applied Mathenlatics(1990)
- Jarre , F. 1994 . Interior-Point Methods via Self-Concordance or Relative Lipschitz Condition , Universität Würzburg . Doctoral Dissertation, Fakultät für Mathematik This paper was just published in the Journal of Optimization Theory and Applicatiorzs 84(1). January 1995
- Kortanek K. O. Zhu J. On Controlling the Parameter in the Logarithmic Barrier Term for Convex Programming Problems The University of lowa. Department of M.S., College of Business Adminitsration 1993 Technical Report
- Lehmkuhl , L. 1993 . A Polynomial Primal-Dual Interior Point Method for Convex Programming with Quadratic Constraints , Washington, DC : The George Washington University . Ph.D Dissertation, Department of Operations Research
- Nesterov , Y. and Nemirovski , A. 1994 . Interior-Point Polynomial Algorithms in Convex Programming . Studies in Applied Mathematics , 13 SIAM