A constrained conjugate gradient method and the solution of linear equations

DOI10.1016/0898-1221(95)00161-QzbMath0835.65080MaRDI QIDQ1905895

M. H. B. M. Shariff

Publication date: 22 January 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

quadratic programmingnumerical examplesparallel computationconjugate gradient methoddirect methodmatrix inversionFletcher and Reeves algorithmminimization problems subject to linear equality constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (4)

A modified augmented Lagrangian method for a class of constrained problems ⋮ A nearly-conservative, high-order, forward Lagrange-Galerkin method for the resolution of compressible flows on unstructured triangular meshes ⋮ Nonmonotone inexact restoration approach for minimization with orthogonality constraints ⋮ Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LINEAR FINITE-ELEMENT EQUATIONS FOR NONLINEAR DEFORMATION OF SLIGHTLY COMPRESSIBLE ELASTIC MATERIAL
• Constrained conjugate directions methods for design optimization of large systems
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• A new approach to variable metric algorithms

This page was built for publication: A constrained conjugate gradient method and the solution of linear equations