论文信息 - On globally stabalized quasi-Newton methods for inequality constrained optimization problems - 字舞流文

On globally stabalized quasi-Newton methods for inequality constrained optimization problems

E. Polak | A. L. Tits | E. Polak | A. Tits

[1] Garth P. McCormick,et al. Penalty function versus non-penalty function methods for constrained nonlinear programming problems , 1971, Math. Program..

[2] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[3] Shih-Ping Han. A globally convergent method for nonlinear programming , 1975 .

[4] Olvi L. Mangasarian,et al. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..

[5] Shih-Ping Han,et al. Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

[6] R. Tapia. Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

[7] M. J. D. Powell,et al. A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[8] Shih Han. A Hybrid Method for Nonlinear Programming , 1978 .

[9] L. Grippo,et al. A New Class of Augmented Lagrangians in Nonlinear Programming , 1979 .

[10] Philip E. Gill,et al. The computation of Lagrange-multiplier estimates for constrained minimization , 1979, Math. Program..

[11] David Q. Mayne,et al. Combined phase I—phase II methods of feasible directions , 1979, Math. Program..

[12] D. Bertsekas. Enlarging the region of convergence of Newton's method for constrained optimization , 1982 .