Optimal Search for the Global Maximum of Functions with Bounded Seminorm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3958602
- scientific article; zbMATH DE number 3873098
- An optimum procedure for searching for the global extremum of a locally unimodal function
- The search for a global maximum of a convex functional on an admissible set
- scientific article; zbMATH DE number 3883956
- Publication:3477901
- The optimal strategies for the search of a maximum for the functions of the class \(W_ 1^ r\)
- Search for a global extremum in a certain subclass of functions with the Lipschitz condition
- On rigorous upper bounds to a global optimum
- Optimal extremum-search algorithms for differentiable functions
Cited in
(11)- Convergence qualification of adaptive partition algorithms in global optimization
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Interval-majorant method and global optimization
- Approximate maxima finding of continuous functions under restricted budget
- The optimal strategies for the search of a maximum for the functions of the class \(W_ 1^ r\)
- Colour-dressed hexagon tessellations for correlation functions and non-planar corrections
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
- On the approximation of the global extremum of a semi-Lipschitz function
- Continuous minimax optimization using modal intervals
- Solving minimax problems by interval methods
- On the edge-independence number and edge-covering number for regular graphs
This page was built for publication: Optimal Search for the Global Maximum of Functions with Bounded Seminorm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719735)
