Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory

DOI10.1007/s10957-005-2087-1zbMath1079.90162OpenAlexW2068299070MaRDI QIDQ2569193

Yanyan Li

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-2087-1

zbMATH Keywords

iterative methodsconjugate gradient methodsLarge-scale unconstrained optimizationplanar indefinite matrices

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (17)

Efficient tridiagonal preconditioner for the matrix-free truncated Newton method ⋮ A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization ⋮ 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 ⋮ 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 ⋮ Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems ⋮ 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. II: Application ⋮ A framework of conjugate direction methods for symmetric linear systems in optimization

Cites Work

• Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
• Iterative solution of linear systems in the 20th century
• A survey of truncated-Newton methods
• Efficient generalized conjugate gradient algorithms. II: Implementation
• Memory gradient method for the minimization of functions
• Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
• Solution of Sparse Indefinite Systems of Linear Equations
• A modification of Armijo's step-size rule for negative curvature
• On the use of directions of negative curvature in a modified newton method
• CUTE
• Exploiting negative curvature directions in linesearch methods for unconstrained optimization
• Function minimization by conjugate gradients
• Hyperbolic Pairs in the Method of Conjugate Gradients

This page was built for publication: Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory