On large-scale unconstrained optimization problems and higher order methods

DOI10.1080/10556780903239071zbMath1202.65074OpenAlexW2003086485MaRDI QIDQ3562406

Geir Gundersen, Trond Steihaug

Publication date: 21 May 2010

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903239071

zbMATH Keywords

unconstrained optimizationnumerical examplesNewton methodlarge-scale problemshigher order methodsHalley methodtensor computationsinduced sparsity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (11)

Sparsity in higher order methods for unconstrained optimization ⋮ Global convergence and the Powell singular function ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ On diagonally structured problems in unconstrained optimization using an inexact super Halley method ⋮ The Chebyshev-Shamanskii method for solving systems of nonlinear equations ⋮ A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class ⋮ Implementable tensor methods in unconstrained convex optimization ⋮ A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods ⋮ Higher-order reverse automatic differentiation with emphasis on the third-order ⋮ On the final steps of Newton and higher order methods ⋮ Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones

Uses Software

• ve08

This page was built for publication: On large-scale unconstrained optimization problems and higher order methods