We discuss the implementation of a number of modern methods of global and nonsmooth continuous optimization, based on the ideas of A. Rubinov [Abstract convexity and global approximation (2000; Zbl 0098.90074)], in the programming library GANSO. GANSO implements the derivative-free bundle method, the extended cutting angle method, dynamical system-based optimization and their various combinations and heuristics. We outline the main ideas behind each method, and report on the interfacing with Matlab and Maple packages
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Crouzeix, Jean-Pierre; Sukhorukova, Nadezda; Ugon, Julien: Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails (2017)
- Cheviakov, A.F.; Ward, M.J.: Optimizing the principal eigenvalue of the Laplacian in a sphere with interior traps (2011)
- Cheviakov, Alexei F.; Ward, Michael J.; Straube, Ronny: An asymptotic analysis of the mean first passage time for narrow escape problems. II: The sphere (2010)
- Beliakov, G.; Ugon, J.: Implementation of novel methods of global and nonsmooth optimization: GANSO programming library (2007)