论文信息 - An iterative method, having linear rate of convergence, for solving a pair of dual linear programs - 字舞流文

An iterative method, having linear rate of convergence, for solving a pair of dual linear programs

An iterative method for dual linear programming problems is described, and its rate of convergence is established.

Werner Oettli | W. Oettli

[1] V. Fridman,et al. An iteration process for the solution of the finite-dimensional contact problem☆ , 1967 .

[2] R. Cottle. Symmetric dual quadratic programs , 1963 .

[3] N. Gastinel. Sur certains procédés itératifs non linéaires de résolution de systèmes d'équations du premier degré , 1962, IFIP Congress.

[4] C. Cryer. The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation , 1971 .

[5] Boris Polyak. Gradient methods for solving equations and inequalities , 1964 .

[6] S. Agmon. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.