On diagonally structured problems in unconstrained optimization using an inexact super Halley method
DOI10.1016/J.CAM.2011.07.006zbMATH Open1256.65055OpenAlexW2128699861MaRDI QIDQ432797FDOQ432797
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
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
numerical examplesconjugate gradient methoditerative methodChebyshev's methodinexact Newton methodHalley's methodlarge scale unconstrained optimizationtruncated Newton method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- A family of Chebyshev-Halley type methods in Banach spaces
- A local convergence theorem for the super-Halley method in a Banach space
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Inexact Newton Methods
- An acceleration of Newton's method: Super-Halley method
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Historical developments in convergence analysis for Newton's and Newton-like methods
- Title not available (Why is that?)
- Sparsity in higher order methods for unconstrained optimization
- On the Halley class of methods for unconstrained optimization problems
- On large-scale unconstrained optimization problems and higher order methods
- On the method of tangent hyperbolas in Banach spaces
- Parallel solution of linear systems with striped sparse matrices
- Rate of convergence of higher-order methods
- An inexact Halley's method
- Theoretical efficiency of a new inexact method of tangent hyperbolas
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
Uses Software
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)
