Abstract: In recognition theory a number of optimization problems appear. The search for the maximum solvable subsystem of the system of linear inequalities is one of these tasks. In this paper two approximation solution methods for given problem are proposed. The first method is based on the theory of nodal solutions of systems of linear inequalities. But the second algorithm principally differs from the first: it is based on some reasoning of geometric nature. The comparison of the represented methods is produced in the number of problems.

Keywords: recognition, optimization, system of linear inequalities, nodal solution

ACM Classification Keywords: G.1.6 Optimization – Constrained Optimization, G.1.3 Numerical Linear Algebra – Linear Systems, I.5 Pattern Recognition

Link:

TWO APPROACHES TO ONE OPTIMIZATION PROBLEM IN RECOGNITION THEORY

Nataliya Katerinochkina

http://foibg.com/ijitk/ijitk-vol05/ijitk05-1-p09.pdf