Sparsity in higher order methods for unconstrained optimization

DOI10.1080/10556788.2011.597853zbMATH Open1244.90220OpenAlexW2020685180MaRDI QIDQ2885474FDOQ2885474

Authors Geir Gundersen, Trond Steihaug 

Publication date 23 May 2012

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

tensorsHalley's methodNewton's methodsChebyshev's method: sparse factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• On large-scale unconstrained optimization problems and higher order methods
• On the Halley class of methods for unconstrained optimization problems
• 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
• A quasi-Newton method with sparse triple factorization for unconstrained minimization

Cites Work

• scientific article; zbMATH DE number 3816913 (Why is no real title available?)
• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 3624709 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A family of Chebyshev-Halley type methods in Banach spaces
• Algorithm 849
• Algorithm 862
• Direct Methods for Sparse Linear Systems
• Efficient MATLAB Computations with Sparse and Factored Tensors
• On large-scale unconstrained optimization problems and higher order methods
• Parallel sparse supports for array intrinsic functions of Fortran 90
• Sparse Matrices in MATLAB: Design and Implementation

Cited In (10)

• 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
• On the Halley class of methods for unconstrained optimization problems
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
• Successive element correction algorithms for sparse unconstrained optimization
• 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
• On large-scale unconstrained optimization problems and higher order methods
• Hyper-sparsity in the revised simplex method and how to exploit it

Uses Software

• MatrixMarket
• ve08
• Algorithm 862

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885474)