Sparsity-preserving sor algorithms for separable quadratic and linear programming
- 31 December 1984
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 11 (2) , 105-112
- https://doi.org/10.1016/0305-0548(69)90004-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A dual differentiable exact penalty functionMathematical Programming, 1983
- Least-norm linear programming solution as an unconstrained minimization problemJournal of Mathematical Analysis and Applications, 1983
- On the convergence of a basic iterative method for the implicit complementarity problemJournal of Optimization Theory and Applications, 1982
- Iterative Solution of Linear ProgramsSIAM Journal on Numerical Analysis, 1981
- Nonlinear Perturbation of Linear ProgramsSIAM Journal on Control and Optimization, 1979
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- On the solution of large, structured linear complementarity problems: The block partitioned caseApplied Mathematics & Optimization, 1977
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960