A relaxed version of the cutting method with approximation of the constraint region
    
    
  
  
  
      
      
      
        
Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 165 (2023) no. 2, pp. 143-152
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
            
              A cutting method was proposed for solving the convex programming problem. The method assumes that the constraint region of the problem is embedded into some polyhedral sets for constructing iteration points. It involves the construction of a sequence of approximations that belongs to the admissible set and is relaxed, as well as implies that the $\varepsilon$-solution of the initial problem is fixed after a finite number of steps. The method also allows to obtain mixed convergent algorithms by using, if desired, any known or new relaxation algorithms for constructing the main iteration points.
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
convex programming, sequence of approximation, relaxation, approximation, generalized support vector, subdifferential, cutting plane.
Mots-clés : convergence
                    
                  
                
                
                Mots-clés : convergence
@article{UZKU_2023_165_2_a3,
     author = {I. Ya. Zabotin and O. N. Shulgina and R. S. Yarullin},
     title = {A relaxed version of the cutting method with approximation of the constraint region},
     journal = {U\v{c}\"enye zapiski Kazanskogo universiteta. Seri\^a Fiziko-matemati\v{c}eskie nauki},
     pages = {143--152},
     publisher = {mathdoc},
     volume = {165},
     number = {2},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZKU_2023_165_2_a3/}
}
                      
                      
                    TY - JOUR AU - I. Ya. Zabotin AU - O. N. Shulgina AU - R. S. Yarullin TI - A relaxed version of the cutting method with approximation of the constraint region JO - Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki PY - 2023 SP - 143 EP - 152 VL - 165 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/UZKU_2023_165_2_a3/ LA - ru ID - UZKU_2023_165_2_a3 ER -
%0 Journal Article %A I. Ya. Zabotin %A O. N. Shulgina %A R. S. Yarullin %T A relaxed version of the cutting method with approximation of the constraint region %J Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki %D 2023 %P 143-152 %V 165 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/UZKU_2023_165_2_a3/ %G ru %F UZKU_2023_165_2_a3
I. Ya. Zabotin; O. N. Shulgina; R. S. Yarullin. A relaxed version of the cutting method with approximation of the constraint region. Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, Tome 165 (2023) no. 2, pp. 143-152. http://geodesic.mathdoc.fr/item/UZKU_2023_165_2_a3/
