A generalization of Polyak's convergence result for subgradient optimization

This publication has 13 references indexed in Scilit:

• The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
  Discrete Applied Mathematics, 1986
• On convergence rates of subgradient optimization methods
  Mathematical Programming, 1977
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
  Management Science, 1977
• The quasigradient method for the solving of the nonlinear programming problems
  Cybernetics and Systems Analysis, 1975
• Validation of subgradient optimization
  Mathematical Programming, 1974
• Convergence conditions for nonlinear programming algorithms
  Cybernetics and Systems Analysis, 1974
• On systems of inequalities with convex functions in the left sides
  American Mathematical Society Translations: Series 2, 1970
• Minimization of unsmooth functionals
  USSR Computational Mathematics and Mathematical Physics, 1969
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954