A multi-start methodology for constrained global optimization using novel constrained local optimizers
暂无分享,去创建一个
[1] Albert A. Groenwold,et al. An efficient parallel global optimization infrastructure for composite structures , 2000 .
[2] Ryszard Zielinski. A statistical estimate of the structure of multi-extremal problems , 1981, Math. Program..
[3] Albert A. Groenwold,et al. Multiple Parallel Local Searches in Global Optimization , 2000, PVM/MPI.
[4] J. Snyman,et al. The Dynamic-Q optimization method: An alternative to SQP? , 2002 .
[5] Jorge Nocedal,et al. A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..
[6] Albert A. Groenwold,et al. Global Optimization using Dynamic Search Trajectories , 2002, J. Glob. Optim..
[7] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .
[8] N. Stander,et al. A dynamic penalty function method for the solution of structural optimization problems , 1994 .
[9] Jan A. Snyman,et al. The LFOPC leap-frog algorithm for constrained optimization , 2000 .
[10] Jorge Nocedal,et al. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.
[11] Klaus Schittkowski,et al. More test examples for nonlinear programming codes , 1981 .
[12] J. Snyman,et al. A multi-start global minimization algorithm with dynamic search trajectories , 1987 .