Iterative Solution of Linear Programs
Author:
- O. L. MangasarianOMO. L. Mangasarian
- 1 August 1981
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 18 (4) , 606-614
Abstract
By perturbing a linear program to a quadratic program, it is possible to solve the latter in its dual variable space by iterative techniques such as successive over-relaxation (SOR) methods. This provides a solution to the original linear program.Keywords
This publication has 11 references indexed in Scilit:
- Nonlinear Perturbation of Linear ProgramsSIAM Journal on Control and Optimization, 1979
- Uniqueness of solution in linear programmingLinear Algebra and its Applications, 1979
- On convergence rates of subgradient optimization methodsMathematical Programming, 1977
- Solution of symmetric linear complementarity problems by iterative methodsJournal of Optimization Theory and Applications, 1977
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear SystemsSIAM Journal on Numerical Analysis, 1976
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975
- Stability Theory for Systems of Inequalities. Part I: Linear SystemsSIAM Journal on Numerical Analysis, 1975
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programsMathematical Programming, 1972
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- Cycling in the dual simplex algorithmNaval Research Logistics Quarterly, 1955