Generalized Lagrange multiplier technique for nonlinear programming
Our aim here is to present numerical methods for solving a general nonlinear programming problem. These methods are based on transformation of a given constrained minimization problem into an unconstrained maximin problem. This transformation is done by using a generalized Lagrange multiplier technique. Such an approach permits us to use Newton's and gradient methods for nonlinear programming. Convergence proofs are provided, and some numerical results are given.
Key WordsNonlinear programming max-min problems Lagrange multiplier technique Newton's method
Unable to display preview. Download preview PDF.
- 1.Evtushenko, Yu. G.,Some Local Properties of Minimax Problems, USSR Computational Mathematics and Mathematical Physics, Vol. 14, No. 3, 1974.Google Scholar
- 2.Evtushenko, Yu. G.,Iterative Methods for Solving Minimax Problems, USSR Computational Mathematics and Mathematical Physics, Vol. 14, No. 5, 1974.Google Scholar
- 3.Polyak, B. T.,Iterative Methods Using Lagrange Multipliers for Solving Extremal Problems with Constraints of the Equation Type, USSR Computational Mathematics and Mathematical Physics, Vol. 10, No. 5, 1970.Google Scholar
- 4.Zangwill, W. T.,Nonlinear Programming, A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.Google Scholar
- 5.Gantmacher, F. R.,The Theory of Matrices, Vol. 1, Chelsea Publishing Company, New York, New York, 1974.Google Scholar
- 6.Liapunov, M. A.,Problème General de la Stabilité du Mouvement, Annals of Mathematical Studies, No. 17, Princeton University Press, Princeton, New Jersey, 1949.Google Scholar
- 7.Kantarovich, L. V., andAkilov, G. P.,Functional Analysis in Normed Space, The Macmillan Company, New York, New York, 1964.Google Scholar