A New Decomposition Algorithm for Solving Convex Quadratic Programming Problems

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)73-76
Number of pages4
JournalProceedings of 2008 International Symposium on Nonlinear Theory and its Applications
Publication statusPublished - 2008

Cite this

@article{3b026c27761c4031bcd5c84dddd419f3,
title = "A New Decomposition Algorithm for Solving Convex Quadratic Programming Problems",
author = "Norikazu Takahashi",
year = "2008",
language = "English",
pages = "73--76",
journal = "Proceedings of 2008 International Symposium on Nonlinear Theory and its Applications",

}

TY - JOUR

T1 - A New Decomposition Algorithm for Solving Convex Quadratic Programming Problems

AU - Takahashi, Norikazu

PY - 2008

Y1 - 2008

M3 - Article

SP - 73

EP - 76

JO - Proceedings of 2008 International Symposium on Nonlinear Theory and its Applications

JF - Proceedings of 2008 International Symposium on Nonlinear Theory and its Applications

ER -