Granular sieving algorithm for selecting best n$$ n $$ parameters
DOI10.1002/mma.8254zbMath1527.90178OpenAlexW4221105191MaRDI QIDQ6087609
Lei Dai, Zehua Chen, Li-Ming Zhang, Tao Qian
Publication date: 12 December 2023
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.8254
Lipschitz conditionpartition of setdeterministic method in global optimizationglobal minimum and minimizer
Nonconvex programming, global optimization (90C26) Lipschitz (Hölder) classes (26A16) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (1)
Cites Work
- Unnamed Item
- A literature survey of benchmark functions for global optimisation problems
- A modified DIRECT algorithm with bilevel partition
- Theory of reproducing kernels and applications
- Global optimization. Scientific and engineering case studies
- Global optimization. From theory to implementation.
- A review of recent advances in global optimization
- Lipschitzian optimization without the Lipschitz constant
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- A taxonomy of global optimization methods based on response surfaces
- An enhancement algorithm for cyclic adaptive Fourier decomposition
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Simplicial Global Optimization
- TRUST: A Deterministic Algorithm for Global Optimization
- Optimal approximation by Blaschke forms
- Deterministic Global Optimization
- Pseudohyperbolic distance and n‐best rational approximation in ℍ2 space
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Cyclic AFD algorithm for the best rational approximation
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization
- Introduction to global optimization.
This page was built for publication: Granular sieving algorithm for selecting best n$$ n $$ parameters
