Kazan Federal University Digital Repository

One approach to constructing cutting algorithms with dropping of cutting planes

Show simple item record

dc.contributor.author Zabotin I.
dc.contributor.author Yarullin R.
dc.date.accessioned 2018-09-18T20:17:07Z
dc.date.available 2018-09-18T20:17:07Z
dc.date.issued 2013
dc.identifier.issn 1066-369X
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/138296
dc.description.abstract We propose a general cutting method for conditional minimization of continuous functions. We calculate iteration points by partially embeddimg the admissible set in approximating polyhedral sets. We describe the features of the proposed method and prove its convergence. The constructed general method does not imply the inclusion of each of approximating sets in the previous one. This feature allows us to construct cutting algorithms which periodically drop any additional restrictions which occur in the solution process. © 2013 Allerton Press, Inc.
dc.relation.ispartofseries Russian Mathematics
dc.subject algorithm
dc.subject approximating set
dc.subject convergence
dc.subject cutting plane
dc.subject Keywords and phrases: conditional minimization
dc.subject sequence of approximations
dc.title One approach to constructing cutting algorithms with dropping of cutting planes
dc.type Article
dc.relation.ispartofseries-issue 3
dc.relation.ispartofseries-volume 57
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 60
dc.source.id SCOPUS1066369X-2013-57-3-SID84876239464


Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace


Advanced Search

Browse

My Account