Convergence proof of minimization algorithms for nonconvex functions

DOI10.1007/BF00933047zbMath0342.90042MaRDI QIDQ1232247

C. Sutti

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items (1)

Nongradient minimization methods for parallel processing computers. I

Cites Work

• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convergence proof of minimization algorithms for nonconvex functions