Skip to content

Optimization Online

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

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

Published: 2023/09/15
  • Alberto Del Pia
  • Aida Khajavirad
  • Categories (Mixed) Integer Nonlinear Programming, 0-1 Programming, Integer Programming Short URL: https://optimization-online.org/?p=24195

    Article

    Download

    View The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

    Post navigation
    Affine FR : an effective facial reduction algorithm for semidefinite relaxations of combinatorial problems
    DeLuxing: Deep Lagrangian Underestimate Fixing for Column-Generation-Based Exact Methods
    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.