A VARIATION OF GOLDFARB'S METHOD FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS AND ITS SUPERLINEAR CONVERGENCE RATE

摘要

This paper presents a variant algorithm of Goldfarb's method for linearly constrained optimization problems. In the variant algorithm, we introduce a concept called conjugate projection, which differs from orthogonal projection. The variant algorithm has global convergence, superlinear convergence rate.