Sparsity in higher order methods for unconstrained optimization

DOI10.1080/10556788.2011.597853zbMath1244.90220OpenAlexW2020685180MaRDI QIDQ2885474

Trond Steihaug, Geir Gundersen

Publication date: 23 May 2012

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

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

zbMATH Keywords

Halley's methodtensorsNewton's methodsChebyshev's method: sparse factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (max. 100)

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 ⋮ High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic ⋮ Higher-order reverse automatic differentiation with emphasis on the third-order ⋮ On the final steps of Newton and higher order methods

Uses Software

• MatrixMarket
• ve08
• Algorithm 862

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Direct Methods for Sparse Linear Systems
• Algorithm 849
• Algorithm 862
• On large-scale unconstrained optimization problems and higher order methods
• Efficient MATLAB Computations with Sparse and Factored Tensors
• Sparse Matrices in MATLAB: Design and Implementation
• A family of Chebyshev-Halley type methods in Banach spaces
• Parallel sparse supports for array intrinsic functions of Fortran 90

This page was built for publication: Sparsity in higher order methods for unconstrained optimization