Global convergence of a robust filter SQP algorithm
AbstractWe present a robust filter SQP algorithm for solving constrained optimization problems. This algorithm is based on the modified quadratic programming proposed by Burke to avoid the infeasibility of the quadratic programming subproblem at each iteration. Compared with other filter SQP algorithms, our algorithm does not require any restoration phase procedure which may spend a large amount of computation. The main advantage of our algorithm is that it is globally convergent without requiring strong constraint qualifications, such as Mangasarian-Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ). Furthermore, the feasible limit points of the sequence generated by our algorithm are proven to be the KKT points if some weaker conditions are satisfied. Numerical results are also presented to show the efficiency of the algorithm.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 206 (2010)
Issue (Month): 1 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Filter SQP Constrained optimization CPLD;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Trindade, Graça & Ambrósio, Jorge, 2012. "An optimization method to estimate models with store-level data: A case study," European Journal of Operational Research, Elsevier, vol. 217(3), pages 664-672.
If references are entirely missing, you can add them using this form.