×

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

2 Bagirov, Adil M.
2 Karmitsa, Napsu
2 Lasserre, Jean-Bernard
2 Magron, Victor
2 Mäkelä, Marko Mikael
1 Deb, Kalyanmoy
1 Dutta, Joydeep
1 Gupta, Shivam
1 Mai, Ngoc Hoang Anh
1 Ngoc Hoang Anh Mai
1 Ranjan, Bhoomija
1 Wang, Jie

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)

Citations by Year