A conjugate gradient algorithm for sparse linear inequalities

DOI10.1016/0377-0427(90)90283-6zbMath0702.65059OpenAlexW2060073354MaRDI QIDQ915387

Masao Fukushima

Publication date: 1990

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(90)90283-6

zbMATH Keywords

conjugate gradient methodsuccessive overrelaxationinconsistencylinear inequalitiessparsityminimum-norm solutionleast-squares solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Entropic perturbation method for solving a system of linear inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• A simultaneous projections method for linear inequalities
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Augmentability in optimization theory
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• Normal solutions of linear programs
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Solving Systems of Linear Equations and Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The conjugate gradient method in extremal problems