Convergence of the cyclical relaxation method for linear inequalities-Reference-Cited by-同舟云学术

Convergence of the cyclical relaxation method for linear inequalities

Published:1984-10 Issue:2 Volume:30 Page:218-228
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Mandel Jan

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02591886.pdf

Reference13 articles.

1. S. Agmon, “The relaxation method for linear inequalities”,Canadian Journal of Mathematics 6 (1954) 382–392.

2. Technical Report MIPG62;Y. Censor,1981

3. R.W. Cottle and J.-S. Pang, “On solving linear complementarity problems as linear programs”,Mathematical Programming Study 7 (1978) 88–107.

4. J.L. Goffin, “On the nonpolynomiality of the relaxation method for systems of linear inequalities”,Mathematical Programming 22 (1982) 93–103.

5. J.L. Goffin, “Acceleration in the relaxation method for linear inequalities and subgradient optimization”, in: E.A. Nurminski, ed., Progress in Nondifferentiable Optimization (IIASA, Laxenburg, 1982) pp. 29–59.

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Algorithm for Polytope Overlapping Detection;Computational Science and Its Applications – ICCSA 2021;2021

2. Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms;Numerical Linear Algebra with Applications;2019-02-21

3. Parallel Method of Pseudoprojection for Linear Inequalities;Communications in Computer and Information Science;2018

4. The Kaczmarz algorithm, row action methods, and statistical learning algorithms;Contemporary Mathematics;2018

5. Convergence rates for Kaczmarz-type algorithms;Numerical Algorithms;2017-10-06