-

 

 

 




Optimization Online





 

A note on polynomial solvability of the CDT problem

Daniel Bienstock (dano***at***columbia.edu)

Abstract: We describe a simple polynomial-time algorithm for the CDT problems that relies on a construction of Barvinok.

Keywords: trust-region, CDT, polynomial-time algorithms

Category 1: Convex and Nonsmooth Optimization

Category 2: Nonlinear Optimization (Quadratic Programming )

Category 3: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Columbia University

Download: [PDF]

Entry Submitted: 12/17/2013
Entry Accepted: 12/17/2013
Entry Last Modified: 11/07/2014

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society