Differential Constraint Scaling in Penalty Function Optimization
暂无分享,去创建一个
Abstract Penalty function optimization techniques are generally very successful in solving nonlinear programming problems. However, they can become computationally ineffective if certain of the constraints tend to dominate the entire constraint set. Under these circumstances, computational efficiency can often be restored by multiplying each constraint by an appropriate scale factor. This article presents a heuristic algorithm for computing such scale factors at periodic intervals during the computation. The method is applied to several sample problems, including some problems which are intentionally ill-scaled and others which are of a more realistic nature. The method is shown to be beneficial in all cases.
[1] B. S. Gottfried,et al. Chemical Process Optimization Using Penalty Functions , 1970 .
[2] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[3] Robert Hooke,et al. `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.
[4] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..