论文信息 - Solution of Linear Inequalities

Solution of Linear Inequalities

A method for solving systems of linear inequalities, consistent and inconsistent, corresponding to the separable and nonseparable cases in pattern recognition is presented. Attempts are made to evaluate the speed and efficiency of the algorithm. It seems to compare in speed with the best algorithms for consistent systems of inequalities in the consistent case and retains remarkable speed in the inconsistent case. There are indications that in many cases it may be relied on to find a complete solution if several runs are taken, most runs achieving a nearly complete solution. The experimental evidence suggests that this is the most efficient and powerful method currently available for finding a solution which satisfies as many cases as possible in a set of linear inequalities.

Peter H. Mengert

[1] O. Mangasarian. Linear and Nonlinear Separation of Patterns by Linear Programming , 1965 .

[2] George Nagy,et al. State of the art in pattern recognition , 1968 .

[3] Yu-Chi Ho,et al. On pattern classification algorithms--Introduction and survey , 1968 .

[4] FRED W. SMITH,et al. Pattern Classifier Design by Linear Programming , 1968, IEEE Transactions on Computers.

[5] Albert B Novikoff,et al. ON CONVERGENCE PROOFS FOR PERCEPTRONS , 1963 .

[6] Y. Ho,et al. A Class of Iterative Procedures for Linear Inequalities , 1966 .

[7] W. Highleyman. Linear Decision Functions, with Application to Pattern Recognition , 1962, Proceedings of the IRE.

[8] Arthur R. Butz,et al. Perceptron type learning algorithms in nonseparable situations. , 1967 .

[9] Richard O. Duda,et al. Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions , 1966, IEEE Trans. Electron. Comput..