Friday, 11:00 - 11:25 h, Room: H 2051

 

Adil Bagirov
Subgradient methods in nonconvex nonsmooth optimization

Coauthors: Alia Al Nuaimat, Napsu Karmitsa, Nargiz Sultanova

 

Abstract:
The subgradient method is known to be the simplest method
in nonsmooth optimization. This method requires only one
subgradient and function evaluation at each iteration and it does
not use a line search procedure. The simplicity of the subgradient method makes it very attractive. This method was studied for only convex problems. In this talk we will present new versions of the subgradient method for solving nonsmooth nonconvex optimization problems. These methods are easy to implement. The efficiency of the proposed algorithms will be demonstrated by applying them to the well known nonsmooth optimization test problems.

 

Talk 2 of the invited session Fri.1.H 2051
"Generalized differentiation and applications" [...]
Cluster 24
"Variational analysis" [...]

 

  signature loans . But it is worth noting that these tests were carried out on the blood cells. Therefore, it's too early to say about scientific evidence of Viagra In Canada influence on blood clots.