 Stochastic and graphical comparisons of the convergence property for multiple runs of non-linear programming algorithmsDewi Rahardja, Yan D. Zhao and Yongming Qu International Journal of Industrial and Systems Engineering, 2007, vol. 2, issue 2, 159-165 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. Keywords: algorithms comparison; nonlinear programming; NLP; multiple runs; empirical density function; mean best objective function values; convergence properties. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:2:y:2007:i:2:p:159-165 Access Statistics for this article More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.