CAJ | 학술논문

本文得到一种可行QP-free算法，引入ε-有效集策略使得每次迭代只需求解规模较小的线性方程组得到迭代方向，且方程组只包含工作集中的约束，其规模较原问题大大减小，同时不进行弧搜索，从而降低了运算量．
본문득도일충가행QP-free산법，인입ε-유효집책략사득매차질대지수구해규모교소적선성방정조득도질대방향，차방정조지포함공작집중적약속，기규모교원문제대대감소，동시불진행호수색，종이강저료운산량．
This paper presents a feasible QP - free method by using the - efficient set. The equations contain only the focus constraints. At each iteration, the smaller group of linear equations with the same efficient matrix needs to be solved to get the iteration direction. Moreover, the equations involve only constrains in the working set and those not in the working set are totally neglected, which reduces the problem size greatly.