id: 05989770
dt: j
an: 05989770
au: Liu, Zhongyi; Chen, Yue
ti: A full-Newton step infeasible interior-point algorithm for linear
    programming based on a self-regular proximity.
so: J. Appl. Math. Inform. 29, No. 1-2, 119-133 (2011).
py: 2011
pu: The Korean Society for Computational and Applied Mathematics, Asan,
    ChungNam
la: EN
cc: 
ut: 
ci: 
li: 
ab: The authors consider the following linear programming problem
    $$\min_{x\in{\bbfR}^n}\, c^T x\quad\text{s.t. }Ax= b, x\ge 0$$ and
    propose an infeasible interior-point algorithm with full-Newton step. A
    special self-regular proximity to induce the feasibility step and also
    to measure proximity to the central path is introduced. Some numerical
    results are given.
rv: Hans Benker (Merseburg)