Extension of Piyavskii's algorithm to continuous global optimization
From MaRDI portal
Recommendations
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- An algorithm for global optimization of Lipschitz continuous functions
Cited in
(15)- A new exclusion test for finding the global minimum
- Global descent method for constrained continuous global optimization
- A modification to the new version of the Price's algorithm for continuous global optimization problems
- On tightness and anchoring of McCormick and other relaxations
- On Hölder global optimization method using piecewise affine bounding functions
- Global optimization of multivariable functions satisfying the Vanderbei condition
- A new extension of Piyavskii's method to Hölder functions of several variables
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set
- Models and Methods for Three External Ballistics Inverse Problems
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- scientific article; zbMATH DE number 7626723 (Why is no real title available?)
- Continuous global optimization through the generation of parametric curves
- Continuous global optimization of multivariable functions based on Sergeev and Kvasov diagonal approach
- Generating \(\alpha \)-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
This page was built for publication: Extension of Piyavskii's algorithm to continuous global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292199)
