Stochastic and graphical comparisons of the convergence property for multiple runs of non-linear programming algorithms Online publication date: Mon, 01-Jan-2007
by Dewi Rahardja, Yan D. Zhao, Yongming Qu
International Journal of Industrial and Systems Engineering (IJISE), Vol. 2, No. 2, 2007
Abstract: Non-Linear Programming (NLP) problems are often encountered in real world applications. For such problems numerous algorithms have been proposed and the convergence properties of single run of these algorithms have typically been assessed. In this article, we focus on computationally unintensive NLP algorithms with random starting values. Such algorithms enable multiple runs for a particular application and the optimum from the multiple runs is taken as the final solution. In such a scenario, the convergence property of multiple runs of an algorithm is of more interest than that of a single run. Therefore, we propose a stochastic and graphical method to assess the convergence property for multiple runs of NLP algorithms. We plot the mean best objective function values found in multiple runs versus the number of runs for several algorithms to examine how each algorithm converges and to compare among algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook