A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees
Keyword(s):
The Cost
◽
Abstract We describe an algorithm based on a logarithmic barrier function, Newton’s method and linear conjugate gradients that seeks an approximate minimizer of a smooth function over the non-negative orthant. We develop a bound on the complexity of the approach, stated in terms of the required accuracy and the cost of a single gradient evaluation of the objective function and/or a matrix-vector multiplication involving the Hessian of the objective. The approach can be implemented without explicit calculation or storage of the Hessian.
2019 ◽
Vol 2019
◽
pp. 1-17
◽
1993 ◽
Vol 16
(3)
◽
pp. 565-572
1997 ◽
pp. 529-574
2000 ◽
Vol 27
(4)
◽
pp. 149-152
◽
Keyword(s):
2005 ◽
Vol 15
(03)
◽
pp. 827-839
◽