Form of presentation | Articles in international journals and collections |
Year of publication | 2019 |
Язык | английский |
|
Konnov Igor Vasilevich, author
Pinyagina Olga Vladislavovna, author
|
Bibliographic description in the original language |
Konnov I, Pinyagina O., Selective bi-coordinate variations without line-search//Journal of Physics: Conference Series. - 2019. - Vol.1158, Is.3. - Art. № 032016. |
Annotation |
In the present paper, we consider the optimal resource allocation problem with simplex-type constraints. For this problem, we propose a modification of the method of bi-coordinate variations with a special threshold control and tolerances, which does not use linear search of step size, and prove its convergence. Preliminary numerical experiments show the efficiency of the proposed modification in comparison with the method using line-search. |
Keywords |
bi-coordinate variations, optimal resource allocation, without line-search |
The name of the journal |
Journal of Physics: Conference Series
|
URL |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063804232&doi=10.1088%2f1742-6596%2f1158%2f3%2f032016&partnerID=40&md5=4cd0492fdf03cc82470f7632d2ce21cb |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=200574&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 |
2019-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2019-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2019 |
ru_RU |
dc.identifier.citation |
Konnov I, Pinyagina O., Selective bi-coordinate variations without line-search//Journal of Physics: Conference Series. - 2019. - Vol.1158, Is.3. - Art. № 032016. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=200574&p_lang=2 |
ru_RU |
dc.description.abstract |
Journal of Physics: Conference Series |
ru_RU |
dc.description.abstract |
In the present paper, we consider the optimal resource allocation problem with simplex-type constraints. For this problem, we propose a modification of the method of bi-coordinate variations with a special threshold control and tolerances, which does not use linear search of step size, and prove its convergence. Preliminary numerical experiments show the efficiency of the proposed modification in comparison with the method using line-search. |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
bi-coordinate variations |
ru_RU |
dc.subject |
optimal resource allocation |
ru_RU |
dc.subject |
without line-search |
ru_RU |
dc.title |
Selective bi-coordinate variations without line-search |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|