Operations Research Transactions ›› 2012, Vol. 16 ›› Issue (1): 21-30.

• Original Articles • Previous Articles     Next Articles

An LVI-based Numerical Algorithm for Solving Quadratic Programming Problems

 ZHANG  Yu-Nong1,2, LI  Xue-Zhong3, ZHANG  Zhi-Jun1, LI  Jun1   

  1. 1. School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006; 2.  Research Institute of Sun Yat-sen University in Shenzhen, Shenzhen 518057; 3. School of Software, Sun Yat-sen University, Guangzhou 510006
  • Received:2011-05-12 Revised:2011-11-14 Online:2012-03-15 Published:2012-03-15
  • Contact: Yunong ZHANG E-mail:zhynong@mail.sysu.edu.cn
  • Supported by:

    This work is supported by The National Natural Science Foundation of China (No. 61075121,  60935001), and also by the Fundamental Research Funds for the Central Universities of China (No. 3162460).

Abstract: This paper presents and investigates a numerical algorithm (termed as 94LVI algorithm) for solving quadratic programming (QP) problems with linear equality and bound constraints. To do this, the constrained QP problems are firstly converted into linear variational inequalities (LVI), which are then converted into equivalent piecewise-linear projection equations (PLPE). After that, the resultant PLPE is solved by the presented 94LVI algorithm. The optimal numerical solutions to the QP problems are thus obtained. Furthermore, the theoretical proof of the global convergence of the 94LVI algorithm is presented. The numerical comparison results between the 94LVI algorithm and the active set algorithm are provided as well, which further demonstrates the efficacy and superiority of the presented algorithm for solving such QP problems.

Key words: numerical algorithm, quadratic programming, 94LVI algorithm, global convergence