Geodesic
Relaxation method for finding a common point of convex sets and its application to optimization problems
Doklady Akademii Nauk, Tome 171 (1966) no. 5, pp. 1019-1022 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1966_171_5_a1,
     author = {L. M. Br\`egman},
     title = {Relaxation method for finding a common point of convex sets and its application to optimization problems},
     journal = {Doklady Akademii Nauk},
     pages = {1019--1022},
     year = {1966},
     volume = {171},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1966_171_5_a1/}
}
TY  - JOUR
AU  - L. M. Brègman
TI  - Relaxation method for finding a common point of convex sets and its application to optimization problems
JO  - Doklady Akademii Nauk
PY  - 1966
SP  - 1019
EP  - 1022
VL  - 171
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/DAN_1966_171_5_a1/
LA  - ru
ID  - DAN_1966_171_5_a1
ER  - 
%0 Journal Article
%A L. M. Brègman
%T Relaxation method for finding a common point of convex sets and its application to optimization problems
%J Doklady Akademii Nauk
%D 1966
%P 1019-1022
%V 171
%N 5
%U http://geodesic.mathdoc.fr/item/DAN_1966_171_5_a1/
%G ru
%F DAN_1966_171_5_a1
L. M. Brègman. Relaxation method for finding a common point of convex sets and its application to optimization problems. Doklady Akademii Nauk, Tome 171 (1966) no. 5, pp. 1019-1022. http://geodesic.mathdoc.fr/item/DAN_1966_171_5_a1/