Abstract
The method of centers is a well-known method for solving nonlinear programming problems having inequality constraints. Pironneau and Polak have recently presented a new version of this method. In the new method, the direction of search is obtained, at each iteration, by solving a convex quadratic programming problem. This direction finding subprocedure is essentially insensitive to the dimension of the space on which the problem is defined. Moreover, the method of Pironneau and Polak is known to converge linearly for finite-dimensional convex programs for which the objective function has a positive-definite Hessian near the solution (and for which the functions involved are twice continuously differentiable). In the present paper, the method and a completely implementable version of it are shown to converge linearly for a very general class of finite-dimensional problems; the class is determined by a second-order sufficiency condition and includes both convex and nonconvex problems. The arguments employed here are based on the indirect sufficiency method of Hestenes. Furthermore, the arguments can be modified to prove linear convergence for a certain class of infinite-dimensional convex problems, thus providing an answer to a conjecture made by Pironneau and Polak.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Huard, P.,Method of Centers, Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1967.
Huard, P.,Programoation Mathematique Convexe, Revue Francaise d'Informatique et de Recherche Opérationnelle, Vol. 7, pp. 43–59, 1968.
Lieu, B. T., andHuard, P.,Le Méthode Des Centres Dans un Space Topologique, Numerische Mathematik, Vol. 8, pp. 56–67, 1966.
Pironneau, O.,andPolak, E.,On the Rate of Convergence of Certain Methods of Centers, Mathematical Programming, Vol. 2, pp. 230–257, 1972.
Geoffrion, A.,Duality in Nonlinear Programming, SIAM Review, Vol. 13, pp. 1–39, 1971.
Hestenes, M. R.,Calculus of Variations and Optimal Control Theory, John Wiley and Sons, New York, New York, 1966.
Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.
Pironneau, O., andPolak, E.,A Dual Method for Optimal Control Problems with Initial and Final Boundary Constraints, SIAM Journal on Control, Vol. 11, pp. 534–549, 1973.
Polak, E.,Computational Methods in Optimization, Academic Press, New York, New York, 1971.
Armijo, L.,Minimization of Functions Having Continuous Partial Derivatives, Pacific Journal of Mathematics, Vol. 16, pp. 1–3, 1966.
Daniel, J. W.,The Approximate Minimization of Functionals, Prentice-Hall, Englewood Cliffs, New Jersey, 1971.
Pshenichnyi, B. N.,Necessary Conditions for an Extremum, Marcel Dekker, New York, New York, 1971.
Luenberger, D. G.,Convergence Rate of a Penalty Functions Scheme, Journal of Optimization Theory and Applications, Vol. 7, pp. 39–51, 1971.
Luenberger, D. G.,The Gradient Projection Method Along Geodesics, Management Science, Vol. 18, pp. 620–631, 1972.
Luenberger, D. G.,Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.
McCormick, G. P.,A Second-Order Method for the Linearly Constrained Nonlinear Programming Problem, Nonlinear Programming, Edited by J. B. Rosen, O. L. Mangasarian, and K. Ritter, Academic Press, New York, New York, 1970.
Robinson, S. M.,A Quadratically-Convergent Algorithm for General Nonlinear Programming Problems, Mathematical Programming, Vol. 3, pp. 145–156, 1972.
Author information
Authors and Affiliations
Additional information
Communicated by M. R. Hestenes
Rights and permissions
About this article
Cite this article
Chaney, R.W. On the Pironneau-Polak method of centers. J Optim Theory Appl 20, 269–295 (1976). https://doi.org/10.1007/BF00933624
Issue Date:
DOI: https://doi.org/10.1007/BF00933624