Sequential Minimax Search for a Maximum When Prior Information is Available
Gal Shmuel · SIAM Journal on Applied Mathematics · 1971
Previous article Next article Sequential Minimax Search for a Maximum When Prior Information is AvailableShmuel GalShmuel Galhttps://doi.org/10.1137/0121063PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] J. Kiefer, Sequential minimax search for a maximum, Proc. Amer. Math. Soc., 4 (1953), 502–506 MR0055639 0050.35702 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Techno-economic and life cycle analyses of battery-assisted hydrogen production systems from photovoltaic powerJournal of Cleaner Production, Vol. 298 Cross Ref Parallel Minimax Searching Algorithm for Extremum of Unimodal Unbounded FunctionInternational Journal of Communications, Network and System Sciences, Vol. 04, No. 09 Cross Ref Optimal sequential and parallel seach for finding a rootJournal of Combinatorial Theory, Series A, Vol. 23, No. 1 Cross Ref Literatur Cross Ref Volume 21, Issue 4| 1971SIAM Journal on Applied Mathematics History Submitted:21 July 1970Published online:12 July 2006 InformationCopyright © 1971 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0121063Article page range:pp. 590-595ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics