On complexity of the translational-cut algorithm for convex minimax problems

Citation
Ka. Ariyawansa et Pl. Jiang, On complexity of the translational-cut algorithm for convex minimax problems, J OPTIM TH, 107(2), 2000, pp. 223-243
Citations number
14
Categorie Soggetti
Engineering Mathematics
Journal title
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
ISSN journal
00223239 → ACNP
Volume
107
Issue
2
Year of publication
2000
Pages
223 - 243
Database
ISI
SICI code
0022-3239(200011)107:2<223:OCOTTA>2.0.ZU;2-I
Abstract
Burke, Goldstein, Tseng, and Ye (Ref. 1) have presented an interesting inte rior-paint algorithm for a class of smooth convex minimax problems. They ha ve also presented a complexity analysis leading to a worst-case bound;on th e total work necessary to obtain a solution within a prescribed tolerance. In this paper, we present refinements to the analysis of Burke et al. which show that the resulting complexity bound can be worse than those for other algorithms available at the time Ref. 1 was published.