Department of Mathematics,Tongji University,Shanghai 200092,China;Department of Mathematics,Sanghai Maritime University,Shanghai 201306,China 在期刊界中查找 在百度中查找 在本站中查找
The paper presents a line search filter sequential quadratic programming(SQP) method for inequality constrained optimization.Compared to traditional SQP methods,the advantages are that the quadratic programming (QP) subproblem is always consistent and the penalty function is not required by filter strategy.Under some mild conditions the global convergence can be induced.