| Форма представления | Статьи в зарубежных журналах и сборниках |
| Год публикации | 2020 |
| Язык | английский |
|
Яруллин Рашид Саматович, автор
|
| Библиографическое описание на языке оригинала |
Yarullin R. (2020) Constructing Mixed Algorithms on the Basis of Some Bundle Method. In: Kochetov Y., Bykadorov I., Gruzdeva T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Communications in Computer and Information Science, vol 1275. Springer, Cham. (SCOPUS) https://doi.org/10.1007/978-3-030-58657-7_14 |
| Аннотация |
Communications in Computer and Information Science |
| Ключевые слова |
nondifferentiable optimization, mixed algorithms, bundle methods, butting planes, sequence of approximations, convex functions |
| Название журнала |
Communications in Computer and Information Science
|
| Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку |
https://repository.kpfu.ru/?p_id=239707 |
Полная запись метаданных  |
| Поле DC |
Значение |
Язык |
| dc.contributor.author |
Яруллин Рашид Саматович |
ru_RU |
| dc.date.accessioned |
2020-01-01T00:00:00Z |
ru_RU |
| dc.date.available |
2020-01-01T00:00:00Z |
ru_RU |
| dc.date.issued |
2020 |
ru_RU |
| dc.identifier.citation |
Yarullin R. (2020) Constructing Mixed Algorithms on the Basis of Some Bundle Method. In: Kochetov Y., Bykadorov I., Gruzdeva T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Communications in Computer and Information Science, vol 1275. Springer, Cham. (SCOPUS) https://doi.org/10.1007/978-3-030-58657-7_14 |
ru_RU |
| dc.identifier.uri |
https://repository.kpfu.ru/?p_id=239707 |
ru_RU |
| dc.description.abstract |
Communications in Computer and Information Science |
ru_RU |
| dc.description.abstract |
In the paper, a method is proposed for minimizing a nondifferentiable convex function. This method belongs to a class of bundle methods. In the developed method it is possible to periodically produce discarding all previously constructed cutting planes that form the model of the objective function. These discards are applied when approximation of the epigraph of the objective function is sufficiently good in the a neighborhood of the current iteration point, and the quality of this approximation is estimated by using the model of the objective function. It is proposed an approach for constructing mixed minimization algorithms on the basis of the developed bundle method with involving any relaxation methods. The opportunity to mix the developed bundle method with other methods is provided as follows. In the proposed method during discarding the cutting planes the main iteration points are fixed with the relaxation condition. Any relaxation minimization method can be used to build these points. Moreover, the convergence of all such mixed algorithms will be guaranteed by the convergence of the developed bundle method. It is important to note that the procedures for updating cutting planes introduced in the bundle method will be transferred to mixed algorithms. The convergence of the proposed method is investigated, its properties are discussed, an estimate of the accuracy of the solution and estimation of the complexity of finding an approximate solution are obtained. |
ru_RU |
| dc.language.iso |
ru |
ru_RU |
| dc.subject |
nondifferentiable optimization |
ru_RU |
| dc.subject |
mixed algorithms |
ru_RU |
| dc.subject |
bundle methods |
ru_RU |
| dc.subject |
butting planes |
ru_RU |
| dc.subject |
sequence of approximations |
ru_RU |
| dc.subject |
convex functions |
ru_RU |
| dc.title |
Constructing Mixed Algorithms on the Basis of Some Bundle Method |
ru_RU |
| dc.type |
Статьи в зарубежных журналах и сборниках |
ru_RU |
|
EN 
中文 
ES 
Карта сайта
