Precision,complexity, and computational schemes of the cubic algorithm |
| |
| Authors: | E A Galperin |
| |
| Institution: | (1) Département de Mathématiques et d'Informatique, Université du Québec à Montréal, Montréal, Québec, Canada |
| |
| Abstract: | 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. |
| |
| Keywords: | Derivative-free optimization nonlinear programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
