An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- 1 December 1972
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 3 (1) , 302-311
- https://doi.org/10.1007/bf01585003
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- An iteration process for the solution of the finite-dimensional contact problemUSSR Computational Mathematics and Mathematical Physics, 1967
- Gradient methods for solving equations and inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1964
- Symmetric dual quadratic programsQuarterly of Applied Mathematics, 1963
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954