|
Numerical methods and programming, 2006, Volume 7, Issue 1, Pages 133–137
(Mi vmp586)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Вычислительные методы и приложения
A separating plane algorithm with limited memory for convex nonsmooth optimization
E. A. Nurminski Institute for Automation and Control Processes, Far Eastern Branch of the Russian Academy of Sciences, Vladivostok
Abstract:
A modification of the separating plane algorithm with storage requirements of the order of
$n^2$ is proposed for $n$-dimensional convex nonsmooth optimization.
Keywords:
convex programming, nonsmooth optimization, separating plane method,.
Citation:
E. A. Nurminski, “A separating plane algorithm with limited memory for convex nonsmooth optimization”, Num. Meth. Prog., 7:1 (2006), 133–137
Linking options:
https://www.mathnet.ru/eng/vmp586 https://www.mathnet.ru/eng/vmp/v7/i1/p133
|
Statistics & downloads: |
Abstract page: | 202 | Full-text PDF : | 56 | References: | 1 |
|