An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization

Abstract This paper presents an affine scaling reduced preconditional conjugate gradient path approach in association with nonmonotonic interior backtracking line search technique for the linear constrained optimization. Employing the affine scaling preconditional conjugate gradient to form the curvilinear path and using interior backtracking line search technique, each iterate switches to trial step of strict interior feasibility. The nonmonotone criterion is used to speed up the convergence progress in the contours of objective function with large curvature. Theoretical analysis are given which prove that the proposed algorithm is globally convergent and has a local superlinear convergence rate under some reasonable conditions.