Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
From MaRDI portal
Publication:2569194
DOI10.1007/s10957-005-2088-0zbMath1079.90163OpenAlexW1977490735MaRDI QIDQ2569194
Publication date: 18 October 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-2088-0
nonconvex problemstruncated Newton methodLarge-scale unconstrained optimizationplanar conjugate gradient method
Related Items (16)
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method ⋮ Preconditioning Newton-Krylov methods in nonconvex large scale optimization ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ Convergence of Liu-Storey conjugate gradient method ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ Conjugate direction methods and polarity for quadratic hypersurfaces ⋮ An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods ⋮ A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization ⋮ Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances ⋮ Iterative computation of negative curvature directions in large scale optimization ⋮ Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation ⋮ Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming ⋮ A new family of conjugate gradient methods ⋮ A dwindling filter line search method for unconstrained optimization ⋮ Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory ⋮ A framework of conjugate direction methods for symmetric linear systems in optimization
Cites Work
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
- A survey of truncated-Newton methods
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Inexact Newton Methods
- Solution of Sparse Indefinite Systems of Linear Equations
- On the use of directions of negative curvature in a modified newton method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- CUTE
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Hyperbolic Pairs in the Method of Conjugate Gradients
This page was built for publication: Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application