A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
暂无分享,去创建一个
[1] S. Agmon. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.
[2] Gabor T. Herman,et al. Relaxation methods for image reconstruction , 1978, CACM.
[3] Sharon Filipowski,et al. On the complexity of solving feasible systems of linear inequalities specified with approximate data , 1995, Math. Program..
[4] P. L. Combettes. The foundations of set theoretic estimation , 1993 .
[5] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[6] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[7] Leonid Khachiyan,et al. On the complexity of approximating the maximal inscribed ellipsoid for a polytope , 1993, Math. Program..
[8] H. W. Kuhn. Solvability and Consistency for Linear Equations and Inequalities , 1956 .
[9] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[10] Patrick L. Combettes,et al. On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints , 2009, Computational Optimization and Applications.
[11] Yinyu Ye,et al. A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..
[12] S. Banach. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .
[13] L. Kantorovich,et al. Functional analysis in normed spaces , 1952 .
[14] Y. Censor,et al. On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning , 1988 .
[15] Gabor T. Herman,et al. Fundamentals of Computerized Tomography: Image Reconstruction from Projections , 2009, Advances in Pattern Recognition.
[16] Gabor T. Herman,et al. Image reconstruction from projections : the fundamentals of computerized tomography , 1980 .
[17] J. W. Gaddum,et al. A theorem on convex cones with applications to linear inequalities , 1952 .
[18] P. Gordan. Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten , 1873 .
[19] I. I. Eremin. Fejér mappings and convex programming , 1969 .
[20] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[21] I. J. Schoenberg,et al. The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.
[22] Jean-Louis Goffin,et al. The Relaxation Method for Solving Systems of Linear Inequalities , 1980, Math. Oper. Res..
[23] Sergei Chubanov. A strongly polynomial algorithm for linear systems having a binary solution , 2012, Math. Program..
[24] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[25] P. L. Combettes,et al. Foundation of set theoretic estimation , 1993 .
[26] D. J. Newman,et al. Location of the Maximum on Unimodal Surfaces , 1965, JACM.
[27] Boris Polyak,et al. The method of projections for finding the common point of convex sets , 1967 .
[28] Jean-Louis Goffin,et al. On the non-polynomiality of the relaxation method for systems of linear inequalities , 1982, Math. Program..
[29] Franziska Wulf,et al. Minimization Methods For Non Differentiable Functions , 2016 .
[30] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[31] Sergei Chubanov. A polynomial relaxation-type algorithm for linear programming , 2011 .
[32] R. L. Kashyap,et al. An Algorithm for Linear Inequalities and its Applications , 1965, IEEE Trans. Electron. Comput..
[33] Bùi-Trong-Liêu,et al. La mèthode des centres dans un espace topologique , 1966 .
[34] Yinyu Ye,et al. Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..
[35] Jesús A. De Loera,et al. On Chubanov's Method for Linear Programming , 2012, INFORMS J. Comput..
[36] Yinyu Ye,et al. How Partial Knowledge Helps to Solve Linear Programs , 1996, J. Complex..
[37] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[38] N. Z. Shor. Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .
[39] David Craft,et al. A fast optimization algorithm for multicriteria intensity modulated proton therapy planning. , 2010, Medical physics.
[40] Wei Chen,et al. A fast algorithm for solving a linear feasibility problem with application to Intensity-Modulated Radiation Therapy. , 2008, Linear algebra and its applications.
[41] Y. Censor,et al. New methods for linear inequalities , 1982 .
[42] Heinz H. Bauschke,et al. On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..
[43] Santosh S. Vempala,et al. A New Approach to Strongly Polynomial Linear Programming , 2010, ICS.
[44] J. Farkas. Theorie der einfachen Ungleichungen. , 1902 .
[45] Th. Motzkin. Beiträge zur Theorie der linearen Ungleichungen , 1936 .