Parallel minimax search for a maximum

DOI10.1016/S0021-9800(68)80083-3zbMath0153.47703OpenAlexW2010933953MaRDI QIDQ5532828

Willard L. Miranker, Richard M. Karp

Publication date: 1967

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(68)80083-3

zbMATH Keywords

maximumunimodal functionsequential search method

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Related Items (12)

Unnamed Item ⋮ Parallel variable metric algorithms for unconstrained optimization ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ Operations research applications of dichotomous search ⋮ Variable block search with prior information ⋮ Search for the maximum of a random walk ⋮ Minimax optimization of a unimodal function by variable block derivative search with time delay ⋮ An almost optimal algorithm for unbounded searching ⋮ Parallel methods for solving equations ⋮ Optimal sequential and parallel search for finding a root ⋮ Parallel algorithms for solving nonlinear two-point boundary-value problems which arise in optimal control ⋮ How many probes are needed to compute the maximum of a random walk?

This page was built for publication: Parallel minimax search for a maximum