Selective bi-coordinate variations without line-search

dc.contributor.author	Konnov I.
dc.contributor.author	Pinyagina O.
dc.date.accessioned	2020-01-15T21:48:47Z
dc.date.available	2020-01-15T21:48:47Z
dc.date.issued	2019
dc.identifier.issn	1742-6588
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/156148
dc.description.abstract	© 2019 IOP Publishing Ltd. 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.
dc.relation.ispartofseries	Journal of Physics: Conference Series
dc.title	Selective bi-coordinate variations without line-search
dc.type	Conference Paper
dc.relation.ispartofseries-issue	3
dc.relation.ispartofseries-volume	1158
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS17426588-2019-1158-3-SID85063804232

Files in this item

Size: 44.07Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.