Skip to content

Optimization Online

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

polynomial-size extended formulation

A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs

Published: 2022/12/15, Updated: 2023/08/29
  • Alberto Del Pia
  • Aida Khajavirad
  • Categories 0-1 Programming, Global Optimization Theory, Integer Programming Tags binary polynomial optimization, hypergraph acyclicity, multilinear polytope, polynomial-size extended formulation

    ArticleDownload View PDF

    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 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 multiobjective optimization 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

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