A note on polynomial solvability of the CDT problem Published: 2013/12/17, Updated: 2015/02/23 Daniel BienstockCategories Constrained Nonlinear Optimization, Convex and Nonsmooth Optimization, Quadratic Programming Tags cdt, polynomial-time algorithms, trust-region methods Short URL: https://optimization-online.org/?p=12696 We describe a simple polynomial-time algorithm for the CDT problems that relies on a construction of Barvinok. CitationColumbia UniversityArticleDownload View PDF