Beliakov, Gleb and Ferrer, Albert 2010, Bounded lower subdifferentiability optimization techniques : applications, Journal of global optimization, vol. 47, no. 2, pp. 211-231.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
In this article we develop a global optimization algorithm for quasiconvex programming where the objective function is a Lipschitz function which may have "flat parts". We adapt the Extended Cutting Angle method to quasiconvex functions, which reduces significantly the number of iterations and objective function evaluations, and consequently the total computing time. Applications of such an algorithm to mathematical programming problems inwhich the objective function is derived from economic systems and location problems are described. Computational results are presented.
Notes
Published online: 17 September 2009
Language
eng
Field of Research
010301 Numerical Analysis 010303 Optimisation
Socio Economic Objective
970101 Expanding Knowledge in the Mathematical Sciences