Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On the convergence of an iterative method for the minimax problem

From MaRDI portal
Publication:4368872
Jump to:navigation, search

DOI10.1017/S0334270000008857zbMATH Open0892.90167OpenAlexW2006131611MaRDI QIDQ4368872

Wenyu Sun

Publication date: 18 December 1997

Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0334270000008857



zbMATH Keywords

minimax problemextended linear-quadratic programming method


Mathematics Subject Classification ID

Nonlinear programming (90C30)



Related Items (5)

On convergence of iterative methods for maximal correlation problems ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ Title not available (Why is that?) ⋮ Two iterative algorithms for finding minimax solutions ⋮ On convergence of minimization methods: Attraction, repulsion, and selection






This page was built for publication: On the convergence of an iterative method for the minimax problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4368872&oldid=18358921"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 00:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki