Projected Newton methods for optimization problems with simple constraints
暂无分享,去创建一个
[1] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .
[2] A. Goldstein. Convex programming in Hilbert space , 1964 .
[3] Sanjoy K. Mitter,et al. Successive approximation methods for the solution of optimal control problems , 1966, Autom..
[4] D. Goldfarb. Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .
[5] G. McCormick. The Variable Reduction Method for Nonlinear Programming , 1970 .
[6] Pravin Varaiya,et al. Notes on Optimization , 1972 .
[7] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[8] Olvi L. Mangasarian,et al. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..
[9] Dimitri P. Bertsekas,et al. Numerical methods for constrained optimization , 1976 .
[10] R. Fletcher,et al. A modified Newton method for minimization , 1977 .
[11] J. Cullum,et al. An algorithm for minimizing a differentiable function subject to box constraints and errors , 1979 .
[12] Danny C. Sorensen,et al. On the use of directions of negative curvature in a modified newton method , 1979, Math. Program..
[13] Melanie L. Lenard,et al. A computational study of active set strategies in nonlinear programming with linear constraints , 1979, Math. Program..
[14] J. Dunn. Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems , 1980 .
[15] J. Dunn. Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .
[16] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .