Abstract
In this article, we propose a nonmonotone linesearch sequential quadratic programming method for general constrained optimization problems without a penalty function or a filter. The algorithm proposed here is a development of the algorithm in Xue et al. [17]. Compared with the former, the novelty of the method we propose is that the new algorithm will achieve the local convergence under weaker assumptions. In order to avoid the Maratos effect, we use the second-order correction in this method, which need not be computed at each iteration. In other words, after a certain number of iterations, there is no need to compute the second-order correction step any more. The global convergence and the locally superlinear convergence of our method are proved under some suitable conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have