Solving large-scale minimax problems with the primal-dual steepest descent algorithm. Erratum

DOI10.1007/BF01585771MaRDI QIDQ1890931zbMATH OpenFDO

Authors Ciyou Zhu

Publication date 26 September 1995

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01585771

zbMATH Keywords

large-scale minimax problemsprimal-dual steepest descent algorithm

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Review text

Correction to a recent paper of the author [ibid. 67, No. 1, 53-76 (1994; Zbl 0820.90104)].

This page was built for publication: Solving large-scale minimax problems with the primal-dual steepest descent algorithm. Erratum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890931)