2W. Murray and M. L. Overton. A Projected Lagrangian algorithm for nonlinear l1 optimization. SIAMJ. Sci. Stat. Comp., 2( 1981 ) :207 - 224.
二级参考文献2
1Ljung L, Sderstrm T. Theory and practice of recursive identification. The MIT Press, 1983
2Bartels R, Conn A. An approach to nonlinear l1 data fitting. in: J. P. Hennart, ed., Lecture Notes in Math.909: Numer. Analy., Cocoyoc,1981; Springer Verlag, Berlin, 1982∶48～58
3KOZA J R.Genetic Programming:On the Programming of Computers by Means of Natural Selection[M].Cambridge,MA:MIT Press.1992:74-75,88-113.
4AUGUSTO D A,BARBOSA J C.Symbolic regression via genetic programming[C].IEEE Ⅵ Brazilian Symposium or Neural Network,2000:173-178.
5LAGARIAS J C,REEDS J A,WRIGHT M H,et.al.Convergence properties of the Nelder-Mead simplex methodin low dimensions[J].SIAM Journal of Optimization,1998,9(1):112-147.
