Kazan Federal University Digital Repository

A Cutting method for finding discrete minimax 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:34:38Z
dc.date.available 2018-09-18T20:34:38Z
dc.date.issued 2014
dc.identifier.issn 1995-0802
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/141315
dc.description.abstract In this paper we propose a cutting method to solve a conditional minimization problem of a discrete maximum function. In the method some polyhedral set approximates the epigraph of the objective function, and to construct the following iteration point we minimize an auxiliary linear function on this set. The method does not imply the inclusion of each of approximating sets in the previous one. This feature allows us to periodically drop any additional restrictions which occur in the solution process. We describe the features of the proposed method and prove its convergence. © 2014 Pleiades Publishing, Ltd.
dc.relation.ispartofseries Lobachevskii Journal of Mathematics
dc.subject approximating set
dc.subject conditional minimization
dc.subject convergence
dc.subject cutting plane
dc.subject discrete maximum function
dc.subject sequence of approximations
dc.title A Cutting method for finding discrete minimax with dropping of cutting planes
dc.type Article
dc.relation.ispartofseries-issue 2
dc.relation.ispartofseries-volume 35
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 157
dc.source.id SCOPUS19950802-2014-35-2-SID84902463816


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

Statistics