Summary
International Symposium on Nonlinear Theory and its Applications
2008
Session Number:A1L-F
Session:
Number:A1L-F3
A New Decomposition Algorithm for Solving Convex Quadratic Programming Problems
Norikazu Takahashi, Yuta Kobayashi, Bo Chen,
pp.-
Publication Date:2008/9/7
Online ISSN:2188-5079
Summary:
A new decomposition method for solving general convex quadratic programming problems is proposed in this paper. Experimental results show that the proposed method is effective when the number of variables is large and the number of equality constraints is small.