Parallel minimax search for a maximum

DOI10.1016/S0021-9800(68)80083-3MaRDI QIDQ5532828zbMATH OpenOpenAlexFDO

Authors Willard L. Miranker, Richard 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

maximumsequential search methodunimodal function

Mathematics Subject Classification ID

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

Recommendations

• An iterative parallel method for minimax problems
• Parallel approximation of min-max problems
• A parallel algorithm for finding the maximum value
• Parallel randomized best-first minimax search.
• Parallelization of the global extremum searching process
• Asynchronously parallel optimization solver for finding multiple minima
• scientific article; zbMATH DE number 559227

Cited in

(12)

• Optimal search algorithm for extrema of a discrete periodic bimodal function
• Variable block search with prior information
• 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?
• Operations research applications of dichotomous search
• Parallel variable metric algorithms for unconstrained optimization
• scientific article; zbMATH DE number 3555342 (Why is no real title available?)
• Search for the maximum of a random walk

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

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