| Форма представления | Статьи в зарубежных журналах и сборниках |
| Год публикации | 2020 |
| Язык | английский |
|
Коннов Игорь Васильевич, автор
Пинягина Ольга Владиславовна, автор
|
| Библиографическое описание на языке оригинала |
Konnov I, Pinyagina O., Adaptive Descent Splitting Method for Decomposable Optimization Problems//Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 2020. - Vol.12095 LNCS, Is.. - P.128-140. |
| Аннотация |
We suggest a modified descent splitting method for optimization problems having a special decomposable structure. The proposed modification maintains the basic convergence properties but enables one to reduce computational efforts per iteration and to provide computations in a distributed manner. On the one hand, it consists in component-wise choice of descent directions together with a special threshold control. On the other hand, it involves a simple adaptive step-size choice, which takes into account the problem behavior along the iteration sequence. Preliminary computational tests confirm the efficiency of the proposed modification. |
| Ключевые слова |
Descent splitting method, Adaptive step-size choice, Decomposable optimization problem, Threshold control, Coordinate-wise step |
| Название журнала |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| URL |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087759116&doi=10.1007%2f978-3-030-49988-4_9&partnerID=40&md5=c7588c005828b0d088f3775566e5ee67 |
| Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку |
https://repository.kpfu.ru/?p_id=236640 |
Полная запись метаданных  |
| Поле DC |
Значение |
Язык |
| dc.contributor.author |
Коннов Игорь Васильевич |
ru_RU |
| 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 |
Konnov I, Pinyagina O., Adaptive Descent Splitting Method for Decomposable Optimization Problems//Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 2020. - Vol.12095 LNCS, Is.. - P.128-140. |
ru_RU |
| dc.identifier.uri |
https://repository.kpfu.ru/?p_id=236640 |
ru_RU |
| dc.description.abstract |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
ru_RU |
| dc.description.abstract |
We suggest a modified descent splitting method for optimization problems having a special decomposable structure. The proposed modification maintains the basic convergence properties but enables one to reduce computational efforts per iteration and to provide computations in a distributed manner. On the one hand, it consists in component-wise choice of descent directions together with a special threshold control. On the other hand, it involves a simple adaptive step-size choice, which takes into account the problem behavior along the iteration sequence. Preliminary computational tests confirm the efficiency of the proposed modification. |
ru_RU |
| dc.language.iso |
ru |
ru_RU |
| dc.subject |
Descent splitting method |
ru_RU |
| dc.subject |
Adaptive step-size choice |
ru_RU |
| dc.subject |
Decomposable optimization problem |
ru_RU |
| dc.subject |
Threshold control |
ru_RU |
| dc.subject |
Coordinate-wise step |
ru_RU |
| dc.title |
Adaptive Descent Splitting Method for Decomposable Optimization Problems |
ru_RU |
| dc.type |
Статьи в зарубежных журналах и сборниках |
ru_RU |
|
EN 
中文 
ES 
Карта сайта
