Skip to content

Optimization Online

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

polynomial integer programming

The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

Published: 2010/05/27
  • Lyubov Romanchuk
  • Shmuel Onn
  • Robert Weismantel
  • Jon Lee
  • Categories (Mixed) Integer Nonlinear Programming Tags graver basis, polynomial integer programming, quadratic integer programming

    Citation IBM Research Report RC24999 Article Download View The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

    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.