Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number (Q1380190)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number
scientific article

    Statements

    Finite iteration method for evaluation of interior point of algebraic polyhedron and bound for step number (English)
    0 references
    9 March 1998
    0 references
    We are interested in a system of strict inequalities \[ Ax<b. \tag{1} \] System (1) is consistent if and only if the following homogeneous system \[ Ax<bt, \quad -t<0, \tag{2} \] is consistent, which, in turn, is equivalent to consistency of the system \[ Ax\leq bt-\gamma, \quad -t\leq- \gamma \tag{3} \] with arbitrary \(\gamma>0\). Easy reduction of the problem of solution's evaluation of the strict system (1) to solving system (3) for any \(\gamma>0\) enables us to apply the Fejér process for construction of finite-step methods for solving system (1) and estimation of the step number. The general idea of the methods under consideration is as follows. If we apply the method of Fejér approximations to system (3), then its iteration sequence \(\{[x_k,t_k]\}\), converges to a certain solution \([\widetilde x,\widetilde t]\) of system (3). Consequently, beginning from some \(k=N\), the vector \([x_k,t_k]\) satisfies system (2), and \(x_k/t_k\) system (1), i.e., for system (1) this process is finite. This scheme contains also some methods of linear correction.
    0 references
    finite iteration method
    0 references
    interior point
    0 references
    algebraic polyhedron
    0 references
    bound for step number
    0 references
    system of strict inequalities
    0 references
    consistency
    0 references
    finite-step methods
    0 references
    method of Fejér approximations
    0 references
    methods of linear correction
    0 references
    0 references

    Identifiers