论文信息 - New contraction methods for linear inequalities - 字舞流文

New contraction methods for linear inequalities

[1] Bingsheng He,et al. A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming , 1992 .

[2] H. Uzawa,et al. Preference, production, and capital: Iterative methods for concave programming , 1989 .

[3] Y. Censor,et al. New methods for linear inequalities , 1982 .

[4] S P Han. Least-Squares Solution of Linear Inequalities. , 1980 .

[5] Gabor T. Herman,et al. Image reconstruction from projections : the fundamentals of computerized tomography , 1980 .

[6] R. Cottle,et al. On solving linear complementarity problems as linear programs , 1978 .

[7] Olvi L. Mangasarian,et al. Linear complementarity problems solvable by A single linear program , 1976, Math. Program..

[8] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

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

[10] I. J. Schoenberg,et al. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[11] Andrew D. Booth,et al. AN APPLICATION OF THE METHOD OF STEEPEST DESCENTS TO THE SOLUTION OF SYSTEMS OF NON-LINEAR SIMULTANEOUS EQUATIONS , 1949 .