Abstract
In this paper, a formulation for an interior-point Newton method of general nonlinear programming problems is presented. The formulation uses the Coleman-Li scaling matrix. The local convergence and the q-quadratic rate of convergence for the method are established under the standard assumptions of the Newton method for general nonlinear programming.
Similar content being viewed by others
References
El-Bakry, A. S., Tapia, R. A., Tsuchiya, T., and Zhang, Y., On the Formulation and Theory of the Newton Interior-Point Method for Nonlinear Programming, Journal of Optimization Theory and Applications, 89, 507-541, 1996.
Byrd, R., Gilbert, J., and Nocedal, J., A Trust-Region Method Based on Interior-Point Techniques for Nonlinear Programming, Mathematical Programming, 89A, 149-185, 2000.
Yamashita, H., and Yabe, H., Superlinear and Quadratic Convergence of Some Primal-Dual Interior-Point Methods for Constrained Optimization, Mathematical Programming, 75, 377-397, 1996.
Dennis, J. E., and Schnabel, R. B., Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
Martinez, H. J., Parada, Z., and Tapia, R. A., On the Characterization of Q-Superlinear Convergence of Quasi-Newton Interior-Point Methods for Nonlinear Programming, Bulletin of the Mexican Mathematical Society, 1, 137-148, 1995.
Boggs, P. T., Tolle, J. W., and Wang, P., On the Local Convergence of Quasi-Newton Methods for Constrained Optimization, SIAM Journal on Control and Optimization, 20, 161-171, 1982.
Dennis, J. E., Heinkenschloss, M., and Vicente, L. N., Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems, SIAM Journal on Control and Optimization, 36, 1750-1794, 1998.
Vicente, L. N., Trust-Region Interior-Point Algorithms for a Class of Nonlinear Programming Problems, PhD Thesis, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, 1996.
Coleman, T. R., and LI, Y., An Interior-Point Trust-Region Approach for Nonlinear Minimization Subject to Bounds, SIAM Journal on Optimization, 6, 418-445, 1996.
Das, I., An Interior-Point Algorithm for the General Nonlinear Programming Problem, Technical Report 96-17, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, 1996.
Ulbrich, M., and Ulbrich, S., Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Problems with Pointwise Bounds, SIAM Journal on Control and Optimization, 38, 1938-1984, 2000.
Tapia, R. A., Quasi-Newton Methods for Equality Constrained Optimization: Equivalence of Existing Methods and a New Implementation, Nonlinear Programming, 3, 125-164, 1978.
Coleman, T. R., and LI, Y., On the Convergence of the Reflective Newton Method for Large-Scale Nonlinear Minimization Subject to Bounds, Mathematical Programming, 67, 189-224, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
El-Alem, M.M., El-Sayed, S. & El-Sobky, B. Local Convergence of the Interior-Point Newton Method for General Nonlinear Programming. Journal of Optimization Theory and Applications 120, 487–502 (2004). https://doi.org/10.1023/B:JOTA.0000025707.93792.be
Issue Date:
DOI: https://doi.org/10.1023/B:JOTA.0000025707.93792.be