lundi 17 mai  à 14h00 salle B014

Intervenant: Rentsen Enkhbat (National University of Mongolia)
-----------
          

Titre:Quasiconvex Programming
-----
Abstract:
---------
 In this talk, we  consider both the
minimization and maximization of a quasiconvex
function over an arbitrary compact set. First, we
formulate global optimality conditions and then, based
on them, propose algorithms for the case in which the
objective function is convex and the feasible set is
nonconvex and compact. The proposed algorithms are
shown to be globally convergent. Some computational
results are presented.