LMBM is a limited memory bundle method for general, possible nonconvex, nonsmooth (nondifferentiable) large-scale minimization. Both the unconsrained version of the method and the version for bound constrained problems are available.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Bagirov, Adil; Karmitsa, Napsu; Mäkelä, Marko M.: Introduction to nonsmooth optimization. Theory, practice and software (2014)
- Deb, Kalyanmoy; Gupta, Shivam; Dutta, Joydeep; Ranjan, Bhoomija: Solving dual problems using a coevolutionary optimization algorithm (2013)
- Karmitsa, N.; Bagirov, A.; Mäkelä, M. M.: Comparing different nonsmooth minimization methods and software (2012)