К сходимости субградиентных методов минимизации выпуклых функций
Issledovanija po prikladnoj matematike (1988)
- Volume: 7, Issue: 3, page 24-32
- ISSN: 1072-3374; 1573-8795/e
Access Full Article
top
How to cite
topКрейнин, М.И.. "К сходимости субградиентных методов минимизации выпуклых функций." Issledovanija po prikladnoj matematike 7.3 (1988): 24-32. <http://eudml.org/doc/68969>.
@article{Крейнин1988,
author = {Крейнин, М.И.},
journal = {Issledovanija po prikladnoj matematike},
keywords = {unconstrained minimization; convex nonsmooth functions; algorithm; Shor- Poljak subgradient minimization method; convergence acceleration; nondifferentiable programming; Shor-Polyak subgradient minimization method},
language = {rus},
number = {3},
pages = {24-32},
publisher = {Izd. Kazanskogo universiteta},
title = {К сходимости субградиентных методов минимизации выпуклых функций},
url = {http://eudml.org/doc/68969},
volume = {7},
year = {1988},
}
TY - JOUR
AU - Крейнин, М.И.
TI - К сходимости субградиентных методов минимизации выпуклых функций
JO - Issledovanija po prikladnoj matematike
PY - 1988
PB - Izd. Kazanskogo universiteta
VL - 7
IS - 3
SP - 24
EP - 32
LA - rus
KW - unconstrained minimization; convex nonsmooth functions; algorithm; Shor- Poljak subgradient minimization method; convergence acceleration; nondifferentiable programming; Shor-Polyak subgradient minimization method
UR - http://eudml.org/doc/68969
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.