Simplified versions of the conditional gradient method

dc.contributor.author	Konnov I.
dc.date.accessioned	2019-01-22T20:36:08Z
dc.date.available	2019-01-22T20:36:08Z
dc.date.issued	2018
dc.identifier.issn	0233-1934
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/147913
dc.description.abstract	© 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group. We suggest simple modifications of the conditional gradient method for smooth optimization problems, which maintain the basic convergence properties, but reduce the implementation cost of each iteration essentially. Namely, we propose an adaptive step-size procedure without any line-search and inexact solution of the direction finding subproblem. Preliminary results of computational tests confirm efficiency of the proposed modifications.
dc.relation.ispartofseries	Optimization
dc.subject	conditional gradient method
dc.subject	convergence properties
dc.subject	inexact direction finding subproblem
dc.subject	Optimization problems
dc.subject	pseudo-convex function
dc.subject	simple adaptive step-size
dc.title	Simplified versions of the conditional gradient method
dc.type	Article
dc.relation.ispartofseries-issue	12
dc.relation.ispartofseries-volume	67
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	2275
dc.source.id	SCOPUS02331934-2018-67-12-SID85054587486

Files in this item

Size: 47.31Kb

Format: PDF

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