Summary
International Symposium on Nonlinear Theory and its Applications
2009
Session Number:C1L-C
Session:
Number:C1L-C2
A Two-Phase Decomposition Algorithm for Solving Convex Quadratic Programming Problems
Yuta Kobayashi, Norikazu Takahashi,
pp.-
Publication Date:2009/10/18
Online ISSN:2188-5079
Summary:
A two-phase decomposition algorithm for convex quadratic programming problems is proposed. Experimental results show that the proposed algorithm can greatly reduce the computation time of the conventional decomposition algorithm when the number of variables is large and the number of equality constraints is small.