Geodesic
A separating plane algorithm with limited memory for convex nonsmooth optimization
Numerical methods and programming, Tome 7 (2006) no. 1, pp. 133-137 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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,. 
@article{VMP_2006_7_1_a16,
     author = {E. A. Nurminski},
     title = {A separating plane algorithm with limited memory for convex nonsmooth optimization},
     journal = {Numerical methods and programming},
     pages = {133--137},
     year = {2006},
     volume = {7},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2006_7_1_a16/}
}
TY  - JOUR
AU  - E. A. Nurminski
TI  - A separating plane algorithm with limited memory for convex nonsmooth optimization
JO  - Numerical methods and programming
PY  - 2006
SP  - 133
EP  - 137
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMP_2006_7_1_a16/
LA  - ru
ID  - VMP_2006_7_1_a16
ER  - 
%0 Journal Article
%A E. A. Nurminski
%T A separating plane algorithm with limited memory for convex nonsmooth optimization
%J Numerical methods and programming
%D 2006
%P 133-137
%V 7
%N 1
%U http://geodesic.mathdoc.fr/item/VMP_2006_7_1_a16/
%G ru
%F VMP_2006_7_1_a16
E. A. Nurminski. A separating plane algorithm with limited memory for convex nonsmooth optimization. Numerical methods and programming, Tome 7 (2006) no. 1, pp. 133-137. http://geodesic.mathdoc.fr/item/VMP_2006_7_1_a16/