LMBM
swMATH ID: | 6158 |
Software Authors: | Karmitsa, N. |
Description: | 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. |
Homepage: | http://napsu.karmitsa.fi/lmbm/ |
Related Software: | LDGB; DGM; Mosek; ARPACK; PNEW; QSM; PBNCGC; COSMO; SDPT3; SparsePOP; L-BFGS; GradSamp; GloptiPoly; TSSOS; SDPLR; MPBNGC; UFO; SolvOpt; Matlab |
Cited in: | 5 Documents |
all
top 5
Cited by 12 Authors
Cited in 4 Serials
1 | ACM Transactions on Mathematical Software |
1 | Journal of Global Optimization |
1 | Optimization Methods & Software |
1 | Mathematical Programming Computation |
Cited in 3 Fields
4 | Operations research, mathematical programming (90-XX) |
1 | Algebraic geometry (14-XX) |
1 | Numerical analysis (65-XX) |