Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

cdt

A note on polynomial solvability of the CDT problem

Published: 2013/12/17, Updated: 2015/02/23
  • Daniel Bienstock
  • Categories Constrained Nonlinear Optimization, Convex and Nonsmooth Optimization, Quadratic Programming Tags 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

    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers approximation algorithms augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity compressed sensing conic optimization convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2023 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.