AN SQP ALGORITHM FOR FINELY DISCRETIZED CONTINUOUS MINIMAX PROBLEMS AND OTHER MINIMAX PROBLEMS WITH MANY OBJECTIVE FUNCTIONS (VOL 6, PG 461, 1996)

Authors
Citation
Jl. Zhou et Al. Tits, AN SQP ALGORITHM FOR FINELY DISCRETIZED CONTINUOUS MINIMAX PROBLEMS AND OTHER MINIMAX PROBLEMS WITH MANY OBJECTIVE FUNCTIONS (VOL 6, PG 461, 1996), SIAM journal on optimization, 8(1), 1998, pp. 284-285
Citations number
2
Categorie Soggetti
Mathematics,Mathematics
ISSN journal
10526234
Volume
8
Issue
1
Year of publication
1998
Pages
284 - 285
Database
ISI
SICI code
1052-6234(1998)8:1<284:ASAFFD>2.0.ZU;2-R
Abstract
An error is pointed out in the local convergence proof in the quoted p aper [J. L. Zhou and A. L. Tits, SIAM J. Optim., 6 (1996), pp. 461-487 ]. A correct proof is given.