P-algorithm based on a simplicial statistical model of multimodal functions
From MaRDI portal
Publication:621736
DOI10.1007/s11750-010-0153-9zbMath1206.90131MaRDI QIDQ621736
Antanas Žilinskas, Julius Žilinskas
Publication date: 28 January 2011
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-010-0153-9
90C26: Nonconvex programming, global optimization
Related Items
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds, A hybrid global optimization algorithm for nonlinear least squares regression, Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic subproblem selection in branch-and-bound algorithms
- An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
- A versatile stochastic model of a function of unknown and time varying form
- A review of statistical models for global optimization
- Interpolation of spatial data. Some theory for kriging
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Global optimization based on a statistical model and simplicial partitioning.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
- On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
- A taxonomy of global optimization methods based on response surfaces
- Testing heuristics: We have it all wrong
- Stochastic global optimization.
- Algorithmic copositivity detection by simplicial partition
- On generalized bisection of 𝑛-simplices
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Algorithm 860
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A radial basis function method for global optimization
