A variant of the multi-step bundle method

dc.contributor.author	Yarullin R.
dc.date.accessioned	2018-09-19T21:30:58Z
dc.date.available	2018-09-19T21:30:58Z
dc.date.issued	2016
dc.identifier.issn	1613-0073
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/144084
dc.description.abstract	Copyright © by the paper's authors.A method from a class of bundle methods is proposed to solve an unconstrained optimization problem. In this method an epigraph of the objective function is approximated by the set which is formed on the basis of the convex quadratic function. This method is characterized in that iteration points are constructed in terms of information obtained in the previous steps of the minimization process. Computational aspects of the proposed method are discussed, convergence of this one is proved, and convergence rate of the iteration process is obtained.
dc.relation.ispartofseries	CEUR Workshop Proceedings
dc.subject	A bundle method
dc.subject	An epigraph
dc.subject	Approximation sets
dc.subject	Convergence rate
dc.subject	Multi-step methods
dc.title	A variant of the multi-step bundle method
dc.type	Conference Paper
dc.relation.ispartofseries-volume	1623
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	315
dc.source.id	SCOPUS16130073-2016-1623-SID85019757775

Files in this item

Size: 43.33Kb

Format: PDF

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