Conditional Gradient Method Without Line-Search

dc.date.accessioned	2019-01-22T20:41:34Z
dc.date.available	2019-01-22T20:41:34Z
dc.date.issued	2018
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/148311
dc.description.abstract	© 2018, Allerton Press, Inc. We propose a simple rule for the step-size choice in the conditional gradient method, which does not require any line-search procedure. It takes into account the current behavior of the method. Its convergence is established under the same assumptions as those for the previously known methods.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	conditional gradient method
dc.subject	optimization problems
dc.subject	step-size choice
dc.title	Conditional Gradient Method Without Line-Search
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	62
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	82
dc.source.id	SCOPUS1066369X-2018-62-1-SID85043316001

Files in this item

Name: SCOPUS1066369X-20 ...

Size: 366.5Kb

Format: PDF

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