Global optimization of Hölder functions
From MaRDI portal
Publication:1918982
DOI10.1007/BF02403997zbMATH Open0848.90110OpenAlexW2319101550MaRDI QIDQ1918982FDOQ1918982
Authors: Eric Gourdin, Brigitte Jaumard, Rachid Ellaia 
Publication date: 23 July 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02403997
Recommendations
branch-and-boundproof of convergencePiyavskij's algorithmunivariate Lipschitz functionsglobal optimization of unconstrained Hölder functions
Cites Work
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Title not available (Why is that?)
- Uncapacitated Plant Location Under Alternative Spatial Price Policies
- An algorithm for finding the absolute extremum of a function
- On Descent from Local Minima
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Iterative Methods for the Localization of the Global Maximum
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- Min-max heaps and generalized priority queues
Cited In (15)
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- New quadratic lower bound for multivariate functions in global optimization
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- On Hölder global optimization method using piecewise affine bounding functions
- Global optimization method of multivariate non-Lipschitz functions using tangent minorants
- 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
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Global minimization algorithms for Hölder functions
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Generating \(\alpha \)-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
- Global optimization in Hilbert space
- Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
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)
