Mathematical Programming

, Volume 90, Issue 1, pp 1–25

Convergence and efficiency of subgradient methods for quasiconvex minimization

  • Krzysztof C. Kiwiel

DOI: 10.1007/PL00011414

Cite this article as:
Kiwiel, K. Math. Program. (2001) 90: 1. doi:10.1007/PL00011414

Abstract.

We study a general subgradient projection method for minimizing a quasiconvex objective subject to a convex set constraint in a Hilbert space. Our setting is very general: the objective is only upper semicontinuous on its domain, which need not be open, and various subdifferentials may be used. We extend previous results by proving convergence in objective values and to the generalized solution set for classical stepsizes tk→0, ∑tk=∞, and weak or strong convergence of the iterates to a solution for {tk}∈ℓ2∖ℓ1 under mild regularity conditions. For bounded constraint sets and suitable stepsizes, the method finds ε-solutions with an efficiency estimate of O-2), thus being optimal in the sense of Nemirovskii.

Key words: quasiconvex programming – convex programming – nondifferentiable optimization – subgradient methods – weak convergence – complexity
Mathematics Subject Classification (1991): 90C26, 65K05, 49M20

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Krzysztof C. Kiwiel
    • 1
  1. 1.Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01–447 Warsaw, Poland, e-mail: kiwiel@ibspan.waw.plPL