VerGO
VerGO is a package designed for the global optimization of a real valued function of many variables. It is portable (usually, only 3 lines of code need to be changed) and has already been ported to several different platforms. The present version number is 0.5.3 which indicates several things: First, the code is not complete. At present, support for constrained optimization is in early stages and is quite untested. Second, the documentation is also not complete which means that there may be mistakes or incomplete instructions. Thirdly, there may be errors in the code itself, leading to incorrect results. At present, this research is looking for researchers who are interested in testing this code to help further develop it into a solid package for verified global optimization.
(Source: http://plato.asu.edu)
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
Sorted by year (- Pintér, János D.; Kampas, Frank J.: Benchmarking nonlinear optimization software in technical computing environments (2013)
- Rebennack, Steffen; Kallrath, Josef; Pardalos, Panos M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems (2009)
- Zhu, Wenxing; Ali, M. M.: Solving nonlinearly constrained global optimization problem via an auxiliary function method (2009)
- Mladenović, Nenad; Dražić, Milan; Kovačevic-Vujčić, Vera; Čangalović, Mirjana: General variable neighborhood search for the continuous optimization (2008)
- Pintér, János D.: Nonlinear optimization with GAMS /LGO (2007)
- Mladenović, N.; Petrović, J.; Kovačević-Vujčić, V.; Čangalović, M.: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (2003)