The Bulletin of Irkutsk State University. Series Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



The Bulletin of Irkutsk State University. Series Mathematics:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


The Bulletin of Irkutsk State University. Series Mathematics, 2014, Volume 10, Pages 13–26 (Mi iigum206)  

A cutting method with updating approximating sets and its combination with other algorithms

I. Ya. Zabotin, R. S. Yarullin

Kazan (Volga Region) Federal University, 18, Kremlyovskaya st., Kazan, 420008

Abstract: For solving constrained minimization problem propose a cutting plane method which belongs to a class of cutting methods. The designed method uses an approximation of the epigraph of the objective function. In the methods of the mentioned class for construction an iteration point on each step the epigraph of the objective function or the constrained set are embedded in some approximation polyhedral sets. Each approximating set is usually constructed on the base of the previous one by cutting of some subset which contains the current iteration point. It is difficult to realize cutting methods in practice, because during growth of iteration's count the number of cutting planes that define approximating sets indefinitely increases. Proposed method is characterized by periodically applying procedures of updating approximating sets due to dropping of the arbitrary number of any planes constructed in the solution process. These procedures are based on the criterion inserted in this paper of the quality of approximating the epigraph of the objective function by embedding sets. Moreover, the method admits its combination with any other famous or new relaxation algorithms, allows to use parallel computations for construction iteration points, and in case of the strongly convex objective function lets to evaluate proximity of each iteration points to optimal. Prove convergence of the method. Discuss ways to specify the control parameters of the method.

Keywords: approximating set, cutting plane, estimations accuracy of the solution, epigraph, sequence of approximations, convergence, conditional minimization.

Full text: PDF file (267 kB)
References: PDF file   HTML file
UDC: 519.853

Citation: I. Ya. Zabotin, R. S. Yarullin, “A cutting method with updating approximating sets and its combination with other algorithms”, The Bulletin of Irkutsk State University. Series Mathematics, 10 (2014), 13–26

Citation in format AMSBIB
\Bibitem{ZabYar14}
\by I.~Ya.~Zabotin, R.~S.~Yarullin
\paper A cutting method with updating approximating sets and its combination with other algorithms
\jour The Bulletin of Irkutsk State University. Series Mathematics
\yr 2014
\vol 10
\pages 13--26
\mathnet{http://mi.mathnet.ru/iigum206}


Linking options:
  • http://mi.mathnet.ru/eng/iigum206
  • http://mi.mathnet.ru/eng/iigum/v10/p13

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Number of views:
    This page:134
    Full text:52
    References:26

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021