Precision, complexity, and computational schemes of the cubic algorithms
The cubic algorithm [see the author, J. Math. Anal. Appl. 112, 635-640 (1985; Zbl 0588.65042)] 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.
multi-extremal, nonconvex Lipschitzian optimization
scientific article; zbMATH DE number 4008117