KFU. Card publication. Adaptive Descent Splitting Method for Decomposable Optimization Problems

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

ADAPTIVE DESCENT SPLITTING METHOD FOR DECOMPOSABLE OPTIMIZATION PROBLEMS

Form of presentation

Articles in international journals and collections

Year of publication

2020

Язык

английский

Authors, employees of KFU

Konnov Igor Vasilevich, author

Pinyagina Olga Vladislavovna, author

Bibliographic description in the original language

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.

Annotation

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.

Keywords

Descent splitting method, Adaptive step-size choice, Decomposable optimization problem, Threshold control, Coordinate-wise step

The name of the journal

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

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=236640&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Konnov Igor Vasilevich	ru_RU
dc.contributor.author	Pinyagina Olga Vladislavovna	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/eng/?p_id=236640&p_lang=2	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	Articles in international journals and collections	ru_RU