Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation

DOI10.1007/S10589-020-00225-8MaRDI QIDQ2023682zbMATH OpenOpenAlexFDO

Authors Andrea Caliciotti, Giovanni Fasano, Florian A. Potra, Massimo Roma

Publication date 3 May 2021

Published in Computational Optimization and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10589-020-00225-8

zbMATH Keywords

Bunch and Kaufman decompositiongradient-related directionslarge scale optimizationtruncated Newton method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Recommendations

• Newton-Type Minimization via the Lanczos Method
• Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
• A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
• Numerical experience with the truncated Newton method for unconstrained optimization
• scientific article; zbMATH DE number 4068627

Cites work

• A survey of truncated-Newton methods
• A truncated Newton method with non-monotone line search for unconstrained optimization
• An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
• Assessing a search direction within a truncated Newton method
• Benchmarking optimization software with performance profiles.
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• scientific article; zbMATH DE number 3881771 (Why is no real title available?)
• scientific article; zbMATH DE number 1049350 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Inexact Newton Methods
• Iterative computation of negative curvature directions in large scale optimization
• Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
• On solving sparse symmetric linear systems whose definiteness is unknown
• Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
• Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
• Preconditioning Newton-Krylov methods in nonconvex large scale optimization
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Truncated-Newton algorithms for large-scale unconstrained optimization
• Trust Region Methods

Cited in

(2)

• An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
• Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods

Describes a project that uses

Uses Software

• tn
• HSL
• CUTEst

This page was built for publication: Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation

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