A Subgradient Projection Method for Quasiconvex Minimization

A subgradient projection method for quasiconvex minimization problems is provided in the following paper. By using strong subdifferentials, it is proved that the generated sequence of the proposed algorithm converges to the solution of the minimization problem of a proper, lower semicontinuous and strongly quasiconvex function under the same assumptions than the convex case with the convex subdifferential. Furthermore, a kind of linear convergence rate of the iterates, which extends similar results for the general quasiconvex case, is also provided.

Article

Download

View A Subgradient Projection Method for Quasiconvex Minimization