On diagonally structured problems in unconstrained optimization using an inexact super Halley method

DOI10.1016/J.CAM.2011.07.006MaRDI QIDQ432797zbMATH OpenOpenAlexFDO

Authors Geir Gundersen, Trond Steihaug

Publication date 4 July 2012

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2011.07.006

zbMATH Keywords

numerical examplesconjugate gradient methoditerative methodChebyshev's methodinexact Newton methodHalley's methodlarge scale unconstrained optimizationtruncated Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Sparsity in higher order methods for unconstrained optimization
• On large-scale unconstrained optimization problems and higher order methods
• On the Halley class of methods for unconstrained optimization problems
• scientific article; zbMATH DE number 6166577
• A non-monotone super-memory gradient method based on the diagonal-sparse quasi-Newton direction

Cites work

• scientific article; zbMATH DE number 3898623 (Why is no real title available?)
• scientific article; zbMATH DE number 3624709 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A family of Chebyshev-Halley type methods in Banach spaces
• A local convergence theorem for the super-Halley method in a Banach space
• An acceleration of Newton's method: Super-Halley method
• An inexact Halley's method
• Historical developments in convergence analysis for Newton's and Newton-like methods
• Inexact Newton Methods
• On large-scale unconstrained optimization problems and higher order methods
• On the Halley class of methods for unconstrained optimization problems
• On the method of tangent hyperbolas in Banach spaces
• Parallel iterative methods for sparse linear systems
• Parallel solution of linear systems with striped sparse matrices
• Rate of convergence of higher-order methods
• Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
• Sparsity in higher order methods for unconstrained optimization
• Theoretical efficiency of a new inexact method of tangent hyperbolas
• Truncated-Newton algorithms for large-scale unconstrained optimization

Cited in

(4)

• Sparsity in higher order methods for unconstrained optimization
• Higher-order reverse automatic differentiation with emphasis on the third-order
• On large-scale unconstrained optimization problems and higher order methods
• A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class

Describes a project that uses

Uses Software

• SPARSKIT
• ve08
• ITSOL
• LANCELOT

This page was built for publication: On diagonally structured problems in unconstrained optimization using an inexact super Halley method

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