>
Fa   |   Ar   |   En
   gradient projection algorithms for optimization problems on convex sets and application to svm  
   
نویسنده bessi radhia ,soumare harouna
منبع international journal of nonlinear analysis and applications - 2023 - دوره : 14 - شماره : 8 - صفحه:197 -215
چکیده    In this paper, we present some gradient projection algorithms for solving optimization problems with a convex-constrained set. we derive the optimality condition when the convex set is a cone and under some mild assumptions, we prove the convergence of these algorithms. finally, we apply them to quadratic problems arising in training support vector machines for the wisconsin diagnostic breast cancer (wdbc) classification problem.
کلیدواژه optimization on convex cones ,projection algorithm ,generalized gradient projection algorithm ,euler inequation ,quadratic optimization problem ,lipschitz continuous gradient ,soft and hard dual svm problem ,classification of breast cancer
آدرس universitétunis el manar, enit, lamsin, tunisie, université tunis el manar, enit, lamsin, tunisie
پست الکترونیکی soumare.harouna@enit.utm.tn
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved