A REVIEW OF LINE SEARCH SEQUENTIAL QUADRATIC PROGRAMMING AND IT IS RATE OF CONVERGENCE
Main Article Content
Abstract
In the last few years the sequential quadratic programming (SQP) methods proposed by Wilson and developed by Han and Powell have widely been recognized as most effective methods for solving nonlinearly constrained optimization problems which can be classified into two categories trust region and line search methods. In this paper we give a review on line search algorithms for equality constrained optimization and prove that the sequence generated by SQP using a line search under certain conditions has global and local superlinear convergence
Downloads
Download data is not yet available.
Article Details
How to Cite
Osman, S. (2013). A REVIEW OF LINE SEARCH SEQUENTIAL QUADRATIC PROGRAMMING AND IT IS RATE OF CONVERGENCE. Journal of Global Research in Mathematical Archives(JGRMA), 1(6), 83–89. Retrieved from https://www.jgrma.com/index.php/jgrma/article/view/73
Section
Review Articles
Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA) the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.
Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal