Global optimization of Hölder functions
From MaRDI portal
Publication:1918982
Recommendations
Cites work
- An algorithm for finding the absolute extremum of a function
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- scientific article; zbMATH DE number 3231137 (Why is no real title available?)
- Iterative Methods for the Localization of the Global Maximum
- Min-max heaps and generalized priority queues
- On Descent from Local Minima
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(16)- Global minimization algorithms for Hölder functions
- Global optimization in Hilbert space
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
- New quadratic lower bound for multivariate functions in global optimization
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- A global minimization algorithm for Lipschitz functions
- A new extension of Piyavskii's method to Hölder functions of several variables
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Generating -dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
- Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
- On Hölder global optimization method using piecewise affine bounding functions
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Efficient global optimization of multivariate functions with unknown Hölder constants via -dense curves
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
This page was built for publication: Global optimization of Hölder functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918982)