PSwarm: A hybrid solver for linearly constrained global derivative-free optimization

Optimization Methods and Software

Volumn 24, Issue 4-5, 2009, Pages 669-685

  Vaz, A I F ^a   Vicente, L N ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Derivative free optimization; Direct search; Global optimization; Linear constraints; Particle swarm; Pattern search

Indexed keywords

DERIVATIVE-FREE OPTIMIZATION; DIRECT SEARCH; LINEAR CONSTRAINTS; PARTICLE SWARM; PATTERN SEARCH;

COMPETITION; CONTROL THEORY; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; IMAGE REGISTRATION;

CONSTRAINED OPTIMIZATION;

EID: 68949135173     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902909948     Document Type: Article

References (35)

1. M.A. Abramson, O.A. Brezhneva, J.E. Dennis, and R.L. Pingel, Pattern search in the presence of degenerate linear constraints, Optim. Methods Software 23 (2008), pp. 297-319.
2. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J.D. Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, PA, 1999.
3. F.v. Bergh and A.P. Engelbrecht, A study of particle swarm optimization particle trajectories, Inform. Sci. 176 (2006), pp. 937-971.
4. L.S. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, G. Henry, M. Heroux, L. Kaufman, A. Lumsdaine, A. Petitet, R. Pozo, K. Remington, and R.C. Whaley, An updated set of basic linear algebra subprograms (BLAS), ACM Trans. Math. Software 28 (2002), pp. 135-151.
5. A.R. Conn, K. Scheinberg, and L.N. Vicente, Introduction to Derivative-Free Optimization. MPS Book Series on Optimization, SIAM, Philadelphia, PA, 2009.
6. DIRECT-A Global Optimization Algorithm. Available at http://www4.ncsu. edu/̃ctk/Finkel-Direct.
7. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201-213.
8. R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, in Proceedings of the Sixth International Symposium on Micro Machine and Human Science, IEEE Service Center, Piscataway, NJ, Nagoya, Japan, 1995, pp. 39-43.
9. J.M. Fernandes, A.I.F. Vaz, and L.N. Vicente, Modelling nearby FGK Population I stars: A new form of estimating stellar parameters using an optimization approach, Tech. Rep. 08-50, Department of Mathematics, University of Coimbra, 2008.
10. R. Fourer, D.M. Gay, and B.W. Kernighan, A modeling language for mathematical programming, Management Sci. 36 (1990), pp. 519-554.
11. GLOBAL Library. Available at http://www.gamsworld.org/global/globallib. htm.
12. N.I.N. Gould, D. Orban, and P.L.Toint, CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited, ACM Trans. Math. Software 29 (2003), pp. 373-394. Available at http://cuter.rl.ac.uk/cuter- www.
13. L. Ingber, Adaptative simulated annealing (ASA): Lessons learned, Control Cybernet. 25 (1996), pp. 33-54.
14. Y. Ji, K.C. Zhang, and S.J. Qu, A deterministic global optimization algorithm, Appl. Math. Comput. 185 (2007), pp. 382-387.
15. D.R. Jones, C.D. Perttunen, and B.E. Stuckman, Lipschitzian optimization without the Lipschitz constant, J. Optim. Theory Appl. 79 (1993), pp. 157-181.
16. J. Kennedy and R. Eberhart, Particle swarm optimization, in Proceedings of the 1995 IEEE International Conference on Neural Networks, IEEE Service Center, Piscataway, NJ, Perth, Australia, pp. 1942-1948.
17. T.G. Kolda, R.M. Lewis, and V. Torczon, Optimization by direct search: New perspectives on some classical and modern methods, SIAM Rev. 45 (2003), pp. 385-482.
18. T.G. Kolda, R.M. Lewis, and V. Torczon, Stationarity results for generating set search for linearly constrained optimization, SIAM J. Optim. 17 (2006), pp. 943-968.
19. R.M. Lewis and V. Torczon, Pattern search methods for linearly constrained minimization, SIAM J. Optim. 10 (2000), pp. 917-941.
20. S. Lucidi, M. Sciandrone, and P. Tseng, Objective-derivative-free methods for constrained optimization, Math. Program. 92 (2002), pp. 37-59.
21. MATLAB, The MathWorks Inc. Available at http://www.mathworks.com
22. Z. Michalewicz, Evolutionary computation techniques for nonlinear programming problems, Int. Trans. Oper. Res. 1 (1994), pp. 223-240.
23. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed., Springer, Berlin 1996.
24. J.J. Moré and S.M. Wild, Benchmarking derivative-free optimization algorithms, SIAM J. Optim. 20 (2009), pp. 172-191.
25. A. Neumaier, The COCONUT benchmark. Available at http://www.mat.univie.ac.at/̃neum/glopt/coconut/Benchmark/Benchmark.html.
26. NOMADm Optimization Software. Available at http://www.gerad.ca/NOMAD/ nomadm.html.
27. The NOMAD Project. Available http://www.gerad.ca/NOMAD.
28. P. Parpas, B. Rustem, and E.N. Pistikopoulos, Linearly constrained global optimization and stochastic differential equations, J. Global Optim. 36 (2006), pp. 191-217.
29. J. Pintér, in Handbook of Global Optimization, P.M. Pardalos and H.E. Romeijn, eds., Nonconvex Optimization and Applications, Vol. 62, chap. 15, Kluwer Academic Publishers, Dordrecht, 2002, pp. 515-569.
30. P.A. Rubin, Generating random points in a polytope, Comm. Statist. Simulation Comput. 13 (1984), pp. 375-396.
31. T.P. Runarsson and X. Yao, Stochastic ranking for constrained evolutionary optimization, IEEE Transactions on Evolutionary Computation 4 (2000), pp. 284-294.
32. J.F. Schutte and A.A. Groenwold, A study of global optimization using particle swarms, J. Global Optim. 31 (2005), pp. 93-108.
33. R.J. Vanderbei, Benchmarks for Nonlinear Optimization. Available at http://www.princeton.edu/̃rvdb/bench.html.
34. A.I.F. Vaz and L.N. Vicente, A particle swarm pattern search method for bound constrained global optimization, J. Global Optim. 39 (2007), pp. 197-219.
35. Y. Zhang and L. Gao, On numerical solution of the maximum volume ellipsoid problem, SIAM J. Optim. 14 (2003), pp. 53-76.