Sunday 24th of September 2017
 

A Superlinearly feasible SQP algorithm for Constrained Optimization


Zhijun Luo

This paper is concerned with a Superlinearly feasible SQP algorithm algorithm for general constrained optimization. As compared with the existing SQP methods, it is necessary to solve equality constrained quadratic programming sub-problems at each iteration, which shows that the computational effort of the proposed algorithm is reduced further. Furthermore, under some mild assumptions, the algorithm is globally convergent and its rate of convergence is one-step superlinearly.

Keywords: Constrained Optimization, SQP Algorithm, Global convergence, Superlinear convergence rate.

Download Full-Text


ABOUT THE AUTHOR

Zhijun Luo
Zhijun Luo received his M.S.degree from Guilin University of Electronic Technology, Guilin, China, in 2008. Now he is a lecturer in Hunan University of Humanities, Science and Technology, Loudi, China. His research interests cover optimization theory, algorithms and their applications.


IJCSI Published Papers Indexed By:

 

 

 

 
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »