Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
type: Item
instance of: scholarly article
title: Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
zbMATH Open document ID: 0407.65045
DOI: 10.1007/BF02246559
published in: Computing
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 65N22
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 53A10
Mathematics Subject Classification ID: 49Q05
Mathematics Subject Classification ID: 35J65
zbMATH DE Number: 3633650
zbMATH Keywords: Accelerate Convergence
zbMATH Keywords: Splittings
zbMATH Keywords: Conjugate Gradient Algorithm
zbMATH Keywords: Discretizations
zbMATH Keywords: Nonlinear Ssor Algorithm
zbMATH Keywords: Large Systems of Nonlinear Equations
zbMATH Keywords: Computational Aspects
zbMATH Keywords: Nonlinear Partial Differential Equations
zbMATH Keywords: Effectiveness
zbMATH Keywords: Nonquadratic Optimization Problem
zbMATH Keywords: Numerical Tests
zbMATH Keywords: Line Search Procedure
author: Dianne P. O'Leary
MaRDI profile type: Publication
cites work: Q4125656
cites work: Q4775412
cites work: Partial conjugate gradient methods for a class of optimal control problems
cites work: Rate of Convergence of Several Conjugate Gradient Algorithms
cites work: Numerical Solution of the Minimal Surface Equation
cites work: Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
cites work: The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
cites work: Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
cites work: Q4072415
cites work: Function minimization by conjugate gradients
cites work: Q3237503
cites work: Methods of conjugate gradients for solving linear systems
cites work: Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
cites work: Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
cites work: Alternative proofs of the convergence properties of the conjugate- gradient method
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: A conjugate direction algorithm without line searches
cites work: Q5652137
cites work: Q5585896
cites work: Restart procedures for the conjugate gradient method
cites work: Relaxation Methods for Convex Problems
full work available at URL: https://doi.org/10.1007/bf02246559
OpenAlex ID: W2121160976
description: scientific article; zbMATH DE number 3633650