Precision, complexity, and computational schemes of the cubic algorithm
暂无分享,去创建一个
The cubic algorithm (Ref. 1) is a nongradient method for the solution of multi-extremal, nonconvex Lipschitzian optimization problems. The precision and complexity of this algorithm are studied, and improved computational schemes are proposed.
[1] Efim A. Galperin,et al. The cubic algorithm , 1985 .
[2] K.S.P. Kumar,et al. On the observability of nonlinear systems: I , 1971 .