Quantitative measure of nonconvexity for black-box continuous functions
From MaRDI portal
Publication:2201645
Recommendations
- Searching for and quantifying nonconvexity regions of functions
- Regional complexity analysis of algorithms for nonconvex smooth optimization
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- A new heuristic approach for non-convex optimization problems
- Global optimization test problems based on random field composition
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- Convex functions and their applications. A contemporary approach
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Discrete Convex Analysis
- Estimates of the Duality Gap in Nonconvex Optimization
- Landscapes and their correlation functions
- Metaheuristics. From design to implementation.
- Monte Carlo methods.
- On the degree and separability of nonconvexity and applications to optimization problems
- The Cambridge dictionary of statistics
Cited in
(2)
This page was built for publication: Quantitative measure of nonconvexity for black-box continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201645)