Abstract
In this work, we first study in detail the formulation of the primal-dual interior-point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as a damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lustig, J., Marsten, R. E., andShanno, D. F.,On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming, SIAM Journal on Optimization, Vol. 2, pp. 435–449, 1992.
Wright, M. H.,Interior Methods for Constrained Optimization, Numerical Analysis Manuscript 91-10, ATT Bell Laboratories, Murray Hill, New Jersey, 1991.
Nash, S. G., andSofer, A.,A Barrier Method for Large-Scale Constrained Optimization, Technical Report 91-10, Department of Operations Research and Applied Statistics, George Mason University, Fairfax, Virginia, 1991.
Wright, S. J.,A Superlinear Infeasible-Interior-Point Algorithm for Monotone Nonlinear Complementarity Problems, Technical Report MCS-P344-1292, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, 1992.
Monteiro, R. C., Pang, J., andWang, T.,A Positive Algorithm for the Nonlinear Complementarity Problem, Technical Report, Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona, 1992.
Wright, S. J.,An Interior-Point Algorithm for Linearly Constrained Optimization, SIAM Journal on Optimization, Vol. 2, pp. 450–473, 1992.
Lasdon, L., Yu, G., andPlummer, J.,An Interior-Point Algorithm for Solving General Nonlinear Programming Problems, Paper Presented at the SIAM Conference on Optimization, Chicago, Illinois, 1992.
Yamashita, H.,A Globally Convergent Primal-Dual Interior Point Method for Constrained Optimization, Technical Report, Mathematical Systems Institute, Tokyo, Japan, 1992.
McCormick, G. P.,The Superlinear Convergence of a Nonlinear Primal-Dual Algorithm, Technical Report T-550/91, School of Engineering and Applied Science, George Washington University, Washington, DC, 1991.
Anstreicher, K. M., andVial, J.,On the Convergence of an Infeasible Primal-Dual Interior-Point Method for Convex Programming, Optimizations Methods and Software, (to appear).
Kojima, M., Megiddo, N., andNoma, N.,Homotopy Continuation Methods for Nonlinear Complementarity Problems, Mathematics of Operations Research, Vol. 16, pp. 754–774, 1991.
Monteiro, R. C., andWright, S. J.,A Globally and Superlinearly Convergent Potential Reduction Interior-Point Method for Convex Programming, Unpublished Manuscript, 1992.
Kojima, M., Mizuno, S., andYoshise, A.,A Primal-Dual Interior-Point Method for Linear Programming, Progress in Mathematical Programming, Interior-Point and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, New York, 1989.
Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Technique, John Wiley and Sons, New York, New York, 1968.
Megiddo, N.,Pathways to the Optimal Set in Linear Programming, Progress in Mathematical Programming, Interior-Point and Related Methods, Edited by N. Megiddo, Springer Verlag, New York, New York, 1989.
Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, pp. 303–329, 1969.
Tapia, R. A.,On the Role of Slack Variables in Quasi-Newton Methods for Constrained Optimization, Numerical Optimization of Dynamic Systems; Edited by L. C. W. Dixon and G. P. Szegö, North Holland, Amsterdam, Holland, 1980.
El-Bakry, A. S., Tapia, R. A., andZhang, Y.,A Study of Indicators for Identifying Zero Variables in Interior-Point Methods, SIAM Review, Vol. 36, pp. 45–72, 1994.
Zhang, Y., Tapia, R. A., andDennis, J. E., Jr.,On the Superlinear and Quadratic Convergence of Primal-Dual Interior-Point Linear Programming Algorithms, SIAM Journal on Optimization, Vol. 2, pp. 304–324, 1992.
Zhang, Y., andTapia, R. A.,Superlinear and Quadratic Convergence of Primal-Dual Interior-Point Algorithms for Linear Programming Revisited, Journal of Optimization Theory and Applications, Vol. 73, pp. 229–242, 1992.
Dennis, J. E., Jr., andSchnabel, R. B.,Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.
Ortega, J. M., andRheinboldt, W. C.,Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970.
Byrd, R. H., andNocedal, J.,A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization, SIAM Journal on Numerical Analysis, Vol. 26, pp. 727–739, 1989.
Hock, W., andSchittkowski, K.,Test Examples for Nonlinear Programming Codes, Springer Verlag, New York, New York, 1981.
Schittkowski, K.,More Test Examples for Nonlinear Programming Codes, Springer Verlag, New York, New York, 1987.
Author information
Authors and Affiliations
Additional information
The first two authors were supported in part by NSF Cooperative Agreement No. CCR-8809615, by Grants AFOSR 89-0363, DOE DEFG05-86ER25017, ARO 9DAAL03-90-G-0093, and the REDI Foundation. The fourth author was supported in part by NSF DMS-9102761 and DOE DE-FG02-93ER25171. The authors would like to thank Sandra Santos for painstakingly proofreading an earlier verion of this paper.
Rights and permissions
About this article
Cite this article
El-Bakry, A.S., Tapia, R.A., Tsuchiya, T. et al. On the formulation and theory of the Newton interior-point method for nonlinear programming. J Optim Theory Appl 89, 507–541 (1996). https://doi.org/10.1007/BF02275347
Issue Date:
DOI: https://doi.org/10.1007/BF02275347