Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
The purpose of the paper is to investigate an iterative regularization method of proximal point type for solving ill-posed vector convex optimization problems in Hilbert spaces. The application to the convex feasibility problems and the common fixed points for nonexpansive potential mappings is al...
Збережено в:
| Дата: | 2008 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут математики НАН України
2008
|
| Назва видання: | Український математичний журнал |
| Теми: | |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/164745 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems / Nguyen Buong // Український математичний журнал. — 2008. — Т. 60, № 9. — С. 1275–1281. — Бібліогр.: 19 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | The purpose of the paper is to investigate an iterative regularization method of proximal point type for
solving ill-posed vector convex optimization problems in Hilbert spaces. The application to the convex
feasibility problems and the common fixed points for nonexpansive potential mappings is also given. |
|---|