1. Equality and inequality constrained optimization algorithms with convergent stepsizes
2. On the formulation and theory of the Newton interior-point method for nonlinear programming
3. Yamashita H., Globally Convergent Primal-Dual Interior-Point Method for Constrained Optimization. Technical Report, Mathematical Systems Institute, Shinjuku, Shinjuku-Ku, Tokyo, Japan, 1995.
4. Gay, D. M., Overton, M. L., and Wright, M. H., A Primal-Dual Interior Method for Nonconvex Nonlinear Programming, Technical Report 97-4-08, Bell Laboratories, Murray Hill, New Jersey, 1997.
5. Vanderbei, R. J., and Shanno, D. F., An Interior-Point Algorithm for Nonconvex Nonlinear Programming, Technical Report SOR-97-21, Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey, 1997.