most citedStrong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.OC2020★ 2 cited

Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization

C. Cartis, N. I. M. Gould, Ph. L. Toint

A trust-region algorithm using inexact function and derivatives values is introduced for solving unconstrained smooth optimization problems. This algorithm uses high-order Taylor m…