CARTopt: a random search method for nonsmooth unconstrained optimization
From MaRDI portal
Publication:377726
DOI10.1007/s10589-013-9560-9zbMath1312.90065OpenAlexW2080052247WikidataQ60401426 ScholiaQ60401426MaRDI QIDQ377726
Publication date: 7 November 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9560-9
Related Items (5)
Global descent method for constrained continuous global optimization ⋮ A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION ⋮ HHCART: an oblique decision tree ⋮ A reflected feature space for CART ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of direct searches for discontinuous functions
- Grid restrained Nelder-Mead algorithm
- Consentability and protocol design of multi-agent systems with stochastic switching topology
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- On Latin hypercube sampling
- A new version of the Price's algorithm for global optimization
- A cover partitioning method for bound constrained global optimization
- Stopping Rules for a Random Optimization Method
- Stochastic global optimization methods part I: Clustering methods
- Testing Unconstrained Optimization Software
- Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
- Adaptive partitioned random search to global optimization
- On Accelerated Random Search
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- Global optimization
This page was built for publication: CARTopt: a random search method for nonsmooth unconstrained optimization
