Recently,there have been many methods to solve quadratic programming(QP) *** this work,on the basis of linear variational inequality(lvi),a simple and effective algorithmic method(i.e.,one-iteration-per-update 94lvi ...
详细信息
Recently,there have been many methods to solve quadratic programming(QP) *** this work,on the basis of linear variational inequality(lvi),a simple and effective algorithmic method(i.e.,one-iteration-per-update 94lvialgorithm)is proposed for solving the time-varying QP problem,which is subject to time-varying linear equality,inequality and bound constraints at the same *** that the normal 94lvialgorithm is usually used to find the optimal solution of the static QP problem in the ***,we transform the QP problem into a piecewise-linear projection equation(PLPE).Then,the continuous time-varying QP problem is divided into many static QP problems via sampling time interval ***,we use the normal 94lvialgorithm to update with only oneiteration based on the solution of previous sampling time instant,and finally we get the solution of each sampling time *** numerical experiments,as a novel approach,the one-iterationper-update 94lvi is able to get the solution of each sampling time instant much quickly and quite accurately when solving the time-varying QP problem.
暂无评论