344
Views
80
CrossRef citations to date
0
Altmetric
Part 2 – Computations and software

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

&
Pages 669-685 | Received 18 Sep 2008, Published online: 07 Aug 2009

References

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

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.