A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
From MaRDI portal
Publication:3191188
DOI10.1017/S1446181113000412zbMath1296.90095MaRDI QIDQ3191188
No author found.
Publication date: 24 September 2014
Published in: The ANZIAM Journal (Search for Journal in Brave)
Related Items
Quasi-random ranked set sampling ⋮ Unnamed Item ⋮ Continuous global optimization through the generation of parametric curves ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization
Uses Software
Cites Work
- Unnamed Item
- CARTopt: a random search method for nonsmooth unconstrained optimization
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Lipschitzian optimization without the Lipschitz constant
- A new version of the Price's algorithm for global optimization
- Global optimization by continuous grasp
- A cover partitioning method for bound constrained global optimization
- Comparison of some random search procedures for a global extremum
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Stochastic global optimization methods part II: Multi level methods
- Testing Unconstrained Optimization Software
- A controlled random search procedure for global optimisation
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Analysis of Generalized Pattern Searches
- On Accelerated Random Search
This page was built for publication: A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
