An optimal algorithm for search of extrema of a bimodal function

DOI10.1016/0885-064X(86)90010-5zbMath0616.65068OpenAlexW1987170206MaRDI QIDQ1821513

Boris S. Veroy

Publication date: 1986

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(86)90010-5

zbMATH Keywords

algorithmdynamic programmingminimax search strategyperiodical bimodal function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39)

Related Items (5)

Bimodal behavior of post-measured entropy and one-way quantum deficit for two-qubit X states ⋮ Average complexity of divide-and-conquer algorithms ⋮ Optimal search algorithm for a minimum of a discrete periodic bimodal function ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ An optimal algorithm for search of extrema of a bimodal function

Cites Work

• An optimal algorithm for search of extrema of a bimodal function
• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• Location of the Maximum on Unimodal Surfaces
• Minimax Optimization of Unimodal Functions by Variable Block Search
• Multidimensional Minimax Search for a Maximum
• A Sequential Method Seeking the Global Maximum of a Function
• An extension of Fibonaccian search to several variables
• Sequential Minimax Search for a Maximum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for search of extrema of a bimodal function