×

Enlarging the region of convergence of Newton’s method for constrained optimization. (English) Zbl 0453.65045


MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
90C20 Quadratic programming
Full Text: DOI

References:

[1] Di Pillo, G., andGrippo, L.,A New Class of Augmented Lagrangians in Nonlinear Programming, SIAM Journal on Control and Optimization, Vol. 17, pp. 618-628, 1979. · Zbl 0418.90077 · doi:10.1137/0317044
[2] Fletcher, R.,A Class of Methods for Nonlinear Programming with Termination and Convergence Properties, Integer and Nonlinear Programming, Edited by J. Abadie, North-Holland Publishing Company, Amsterdam, Holland, 1970. · Zbl 0332.90039
[3] Mayne, D. Q., andPolak, E.,A Superlinearly Convergent Algorithm for Constrained Optimization Problems, Imperial College, Department of Computing and Control, Research Report No. 78/52, 1978.
[4] Powell, M. J. D.,Algorithms for Nonlinear Constraints that Use Lagrangian Functions, Mathematical Programming, Vol. 14, pp. 224-248, 1978. · Zbl 0383.90092 · doi:10.1007/BF01588967
[5] Powell, M. J. D.,The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Calculations, Nonlinear Programming 3, Edited by O. L. Mangasarian, R. Meyer, and S. Robinson, Academic Press, New York, New York, 1978. · Zbl 0464.65042
[6] Pshenichnyi, B. N.,Algorithm for the General Problem of Mathematical Programming, Kibernetika, No. 5, pp. 120-125, 1970 (in Russian).
[7] Pshenichnyi, B. N., andDanilin, Y. M.,Numerical Methods in Extremal Problems, Mir Publishers, Moscow, USSR, 1978.
[8] Han, S. P.,A Globally Convergent Method for Nonlinear Programming, Journal of Optimization Theory and Applications, Vol. 22, pp. 297-309, 1977. · Zbl 0336.90046 · doi:10.1007/BF00932858
[9] Mayne, D. Q., andMaratos, N.,A First-Order Exact Penalty Function Algorithm for Equality Constrained Optimization Problems, Mathematical Programming, Vol. 16, pp. 303-324, 1979. · Zbl 0397.90081 · doi:10.1007/BF01582118
[10] Wilson, R. B.,A Simplicial Algorithm for Concave Programming, Harvard University, Graduate School of Business Administration, PhD Dissertation, 1963.
[11] Ortega, J. M., andRheinboldt, W. C.,Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970. · Zbl 0241.65046
[12] 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. · Zbl 0336.65034 · doi:10.1007/BF00933161
[13] Di Pillo, G., Grippo, L., andLampariello, F.,A Method for Solving Equality Constrained Optimization Problems by Unconstrained Minimization, Proceedings of the 9th IFIP Conference on Optimization Techniques, Warsaw, Poland, 1970. · Zbl 0445.90062
[14] Fletcher, R., andLill, S.,A Class of Methods for Nonlinear Programming: II Computational Experience, Nonlinear Programming, Edited by J. B. Rosen, O. L. Mangasarian, and K. Ritter, Academic Press, New York, New York, 1971.
[15] Fletcher, R.,A Class of Methods for Nonlinear Programming, III, Rates of Convergence, Numerical Methods for Nonlinear Optimization, Edited by F. A. Lootsma, Academic Press, New York, New York, 1973.
[16] Mukai, H., andPolak, E.,A Quadratically Convergent Primal-Dual Method with Global Convergence Properties for Solving Optimization Problems with Equality Constraints, Mathematical Programming, Vol. 9, pp. 336-349, 1975. · Zbl 0351.90065 · doi:10.1007/BF01681354
[17] Glad, T., andPolak, E.,A Multiplier Method with Automatic Limitation of Penalty Growth, Mathematical Programming, Vol. 17, pp. 140-155, 1979. · Zbl 0414.90078 · doi:10.1007/BF01588240
[18] Maratos, N.,Exact Penalty Function Algorithms for Finite-Dimensional and Control Problems, Imperial College, PhD Thesis, 1978.
[19] Chamberlain, R. M., Lemarechal, C., Pedersen, H. C., andPowell, M. J. D.,The Watchdog Technique for Forcing Convergence in Algorithms for Constrained Optimization, Tenth International Symposium on Mathematical Programming, Montreal, Canada, 1979. · Zbl 0477.90072
[20] Garcia Palomares, U. M., andMangasarian, O. L.,Superlinearly Convergent Quasi-Newton Algorithms for Nonlinearly Constrained Optimization Problems, Mathematical Programming, Vol. 11, pp. 1-13, 1976. · Zbl 0362.90103 · doi:10.1007/BF01580366
[21] Glad, T.,Properties of Updating Methods for the Multipliers in Augmented Lagrangians, Journal of Optimization Theory and Applications, Vol. 28, pp. 135-156, 1979. · Zbl 0403.90070 · doi:10.1007/BF00933239
[22] Bertsekas, D. P.,Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, New York, 1982 (to appear). · Zbl 0572.90067
[23] Di Pillo, G., andGrippo, L.,An Augmented Lagrangian for Inequality Constraints in Nonlinear Programming Problems, Università di Roma, Instituto di Automatica, Report No. 79-22, 1979.
[24] Poljak, B. T.,Iterative Methods Using Lagrange Multipliers for solving Extremal Problems with Constraints of the Equation Type, Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, Vol. 10, pp. 1098-1106, 1970 (in Russian). · Zbl 0217.27501
[25] Dennis, J. E., andMore, J. J.,A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods, Mathematics of Computation, Vol. 28, pp. 549-560, 1974. · Zbl 0282.65042 · doi:10.1090/S0025-5718-1974-0343581-1
[26] Robinson, S. M.,Perturbed Kuhn-Tucker Points and Rates of Convergence for a Class of Nonlinear Programming Algorithms, Mathematical Programming, Vol. 7, pp. 1-16, 1974. · Zbl 0294.90078 · doi:10.1007/BF01585500
[27] Tapia, R. A.,Quasi-Newton Methods for Equality Constrained Optimization: Equivalence of Existing Methods and a New Implementation, Nonlinear Programming 3, Edited by O. L. Managasarian, R. Meyer, and S. Robinson, Academic Press, New York, New York, 1978. · Zbl 0469.49026
[28] Bertsekas, D. P.,Variable Metric Methods for Constrained Optimization Based on Exact Differentiable Penalty Functions, Proceedings of the 18th Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana, Illinois, pp. 584-593, 1980.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.