ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems (2000)

Ariyawansa, K. A. ; Jiang, P. L.

Springer

Journal of optimization theory and applications 107 (2000), S. 223-243

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1573-2878

Schlagwort(e): complexity ; minimax optimization ; global Newton method ; interior-point methods ; analytic centers

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik

Notizen: Abstract Burke, Goldstein, Tseng, and Ye (Ref. 1) have presented an interesting interior-point algorithm for a class of smooth convex minimax problems. They have also presented a complexity analysis leading to a worst-case bound on the 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.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1023/A:1026422013954

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer