An algorithm for minimizing a differentiable function subject to box constraints
暂无分享,去创建一个
A quasi-Newton algorithm for minimizing a function subject to box constraints is described. Since our original motivation came from the optimization of electrical circuits, this algorithm is designed to tolerate errors in the function and gradient evaluations. Theorems are given to support the use of the symmetric rank one update.
[1] D. Goldfarb. Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .
[2] Bruce A. Murtagh,et al. Computational Experience with Quadratically Convergent Minimisation Methods , 1970, Comput. J..
[3] Roger Fletcher,et al. An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..