This article is cited 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,.

UDC: 519.853.3