A cutting-plane method without inclusions of approximating sets for conditional minimization

dc.contributor.author	Zabotin I.
dc.contributor.author	Yarullin R.
dc.date.accessioned	2018-09-18T20:34:47Z
dc.date.available	2018-09-18T20:34:47Z
dc.date.issued	2015
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141340
dc.description.abstract	© 2015, Pleiades Publishing, Ltd. Propose a cutting-plane method with partially embedding of a feasible set for solving a conditional minimization problem. The proposed method is characterized by possibility of periodically dropping of an arbitrary number of any planes constructed in the solution process. Prove convergence of the method, discuss its features, represent assessments of the solution’s accuracy.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	a cutting plane
dc.subject	a sequence of approximations
dc.subject	an approximating set
dc.subject	an epigraph
dc.subject	conditional minimization
dc.subject	convergence
dc.title	A cutting-plane method without inclusions of approximating sets for conditional minimization
dc.type	Article
dc.relation.ispartofseries-issue	2
dc.relation.ispartofseries-volume	36
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	132
dc.source.id	SCOPUS19950802-2015-36-2-SID84934931449

Файлы в этом документе

Размер: 44.08Kb

Формат: PDF

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