Abstract
Implementation of the penalty function method for constrained optimization poses numerical difficulties as the penalty parameter increases. To offset this problem, one often resorts to Newton's method. In this note, working in the context of the penalty function method, we establish an intimate connection between the second-order updating formulas which result from Newton's method on the primal problem and Newton's method on the dual problem.
Similar content being viewed by others
References
Tapia, R. A.,Diagonalized Multiplier Methods and Quasi-Newton Methods for Constrained Optimization, Journal of Optimization Theory and Applications, Vol. 22, pp. 135–194, 1977.
Bertsekas, D.,Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, New York, 1982.
Hestenes, M.,Optimization Theory, John Wiley, New York, New York, 1976.
Buys, J. D.,Dual Algorithms for Constrained Optimization, Rijksuniversiteit de Leiden, The Netherlands, PhD Thesis, 1972.
Fletcher, R.,An Ideal Penalty Function for Constrained Optimization, Journal of the Institute of Mathematics and Applications, Vol. 15, pp. 319–342, 1975.
Kelley, H. J., Denham, W., Johnson, I., andWheatley, P.,An Accelerated Gradient Method for Parameter Optimization with Nonlinear Constraints, Journal of the Astronautical Sciences, Vol. 13, pp. 166–169, 1966.
Indusi, J.,A Computer Algorithm for Constrained Minimization, Minimization Algorithms, Edited by G. Szego, Academic Press, New York, New York, pp. 230–312, 1972.
Author information
Authors and Affiliations
Additional information
Communicated by R. A. Tapia
The author wishes to thank Professor R. A. Tapia for his careful review of this note. He has contributed significantly to its content through several crucial observations.
Rights and permissions
About this article
Cite this article
Beltrami, E.J. A note on the method of multipliers. J Optim Theory Appl 45, 477–480 (1985). https://doi.org/10.1007/BF00938447
Issue Date:
DOI: https://doi.org/10.1007/BF00938447