cdt – Optimization Online

A note on polynomial solvability of the CDT problem

Published: 2013/12/17, Updated: 2015/02/23

Constrained Nonlinear Optimization, Convex and Nonsmooth Optimization, Quadratic Programming cdt, polynomial-time algorithms, trust-region methods

We describe a simple polynomial-time algorithm for the CDT problems that relies on a construction of Barvinok. Citation Columbia University Article Download View A note on polynomial solvability of the CDT problem