CARTopt: A random search method for nonsmooth unconstrained optimization

Computational Optimization and Applications

Volumn 56, Issue 2, 2013, Pages 291-315

  Robertson, B L ^a   Price, C J ^a   Reale, M ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

CART; Nonsmooth optimization; Numerical results; Partitioning random search

Indexed keywords

CART; CLASSIFICATION AND REGRESSION TREE; NONSMOOTH OPTIMIZATION; NUMERICAL RESULTS; RANDOM SEARCH ALGORITHM; RANDOM SEARCHES; STATISTICAL PATTERN RECOGNITION; UNCONSTRAINED OPTIMIZATION;

ALGORITHMS; NUMERICAL METHODS; PATTERN RECOGNITION; TREES (MATHEMATICS);

OPTIMIZATION;

EID: 84884812701     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-013-9560-9     Document Type: Article

References (25)

1. Appel, M.J., Labarre, R., Radulovic, D.: On accelerated random search. SIAM J. Optim. 14, 708-731 (2003)
2. Audet, C., Dennis, J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188-217 (2006)
3. Brachetti, P., Ciccoli, M.D.F., Di Pillo, G., Lucidi, S.: A new version of the Price's algorithm for global optimization. J. Glob. Optim. 10, 165-184 (1997)
4. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)
5. Burmen, Á., Puhan, J., Tuma, T.: Grid restrained Nelder Mead algorithm. Comput. Optim. Appl. 34, 359-375 (2006)
6. Clarke, F.H.: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics. SIAM, Philadelpha (1990)
7. Dorea, C.C.Y.: Stopping rules for a random optimization method. SIAM J. Control Optim. 28, 841-850 (1990)
8. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley-Interscience, New York (2001)
9. Hart, W.E.: Sequential stopping rules for random optimization methods with applications to multistart local search. SIAM J. Optim. 9, 270-290 (1998)
10. Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin (1981)
11. Loh, W.: On latin hypercube sampling. Ann. Stat. 24, 2058-2080 (1996)
12. Lukšan, L., Vlc̆ek, J.: Test problems for unconstrained optimization. Technical Report no. 8. Academy of Sciences of the Czech Republic, Institute of Computer Science (2003)
13. Martinez, W.L., Martinez, A.R.: Computational Statistics Handbook with MATLAB. Chapman & Hall/CRC Press, London/Boca Raton (2002)
14. Moré, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17-41 (1981)
15. Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308-313 (1965)
16. Price, C.J., Reale, M., Robertson, B.L.: A direct search method for smooth and nonsmooth unconstrained optimization. ANZIAM J. 48, C927-C948 (2006)
17. Price, C.J., Robertson, B.L., Reale, M.: A hybrid Hooke and Jeeves - Direct method for nonsmooth optimization. Adv. Model. Optim. 11, 43-61 (2009)
18. Price, C.J., Reale, M., Robertson, B.L.: A cover partitioning method for bound constrained global optimization. Optim. Methods Softw. 27, 1059-1072 (2012). doi: 10.1080/10556788.2011.557726
19. Rinnooy Kan, A.H.G., Timmer, G.T.: Stochastic global optimization methods. Part I. Clustering methods. Math. Program. 39, 27-56 (1987)
20. Robertson, B.L., Price, C.J., Reale, M.: Nonsmooth optimization using classification and regression trees. In: Proceedings of the 18th IMACS World Congress and MODSIM09 International Congress on Modelling and Simulation, Cairns, Australia, July 13-17, 2009, pp. 1195-1201 (2009)
21. Robertson, B.L.: Direct search methods for nonsmooth problems using global optimization techniques. Ph.D. Thesis, University of Canterbury, Christchurch, New Zealand (2010)
22. Schittkowski, K.: More Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol. 282. Springer, Berlin (1987)
23. Tang, Z.B.: Adaptive partitioned random search to global optimization. IEEE Trans. Autom. Control 39, 2235-2244 (1994)
24. Torn, A., Žilinskas, A.: Global Optimization. Lecture Notes in Computer Science, vol. 350. Springer, Berlin (1989)
25. Vicente, L.N., Custódio, A.L.: Analysis of direct searches for discontinuous functions. Math. Program. 133, 299-325 (2012)