Optimal Search for the Global Maximum of Functions with Bounded Seminorm

DOI10.1137/0722053zbMath0591.65046OpenAlexW2001234298MaRDI QIDQ3719735

Patricio Basso

Publication date: 1985

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0722053

zbMATH Keywords

global maximizationone-dimensional maximization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (8)

Solving minimax problems by interval methods ⋮ On the approximation of the global extremum of a semi-Lipschitz function ⋮ Continuous minimax optimization using modal intervals ⋮ Colour-dressed hexagon tessellations for correlation functions and non-planar corrections ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ Interval-majorant method and global optimization

This page was built for publication: Optimal Search for the Global Maximum of Functions with Bounded Seminorm