Precision, complexity, and computational schemes of the cubic algorithms
type: Item
instance of: scholarly article
title: Precision, complexity, and computational schemes of the cubic algorithms
zbMATH Open document ID: 0621.90070
DOI: 10.1007/BF00938537
author: E. A. Galperin
published in: Journal of Optimization Theory and Applications
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 4008117
zbMATH Keywords: cubic algorithm
zbMATH Keywords: nongradient method
zbMATH Keywords: multi-extremal, nonconvex Lipschitzian optimization
zbMATH Keywords: derivative-free optimization
MaRDI profile type: Publication
cites work: The cubic algorithm
description: scientific article; zbMATH DE number 4008117