A Modified Penalty-free-type Nonmonotone SQP Method
A modified penalty-free-type nonmonotone SQP method for inequality constrained optimization is proposed in this paper. This algorithm has no need on the penalty function and allows nonmonotonic decrease for the constrained violation function. Comparing with the filter-based approaches, our method leads to more flexibility. Under some reasonable conditions, the global convergence properties of our algorithm is presented. Moreover, some numerical results are given.
Sequential quadratic programming Nonmono-tone Global convergence
KeSu
College of Mathematics and Computer Science,Hebei University, Baoding, 071002, P.R.China
国际会议
昆明、丽江
英文
462-466
2011-04-15(万方平台首次上网日期,不代表论文的发表时间)