Skip to content

Optimization Online

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

Convexification of classes of mixed-integer sets with L♮-convexity

Published: 2025/11/25
  • Qimeng Yu
  • Simge Küçükyavuz
  • Categories (Mixed) Integer Nonlinear Programming Tags continuous mixing set, convex hull, L♮-convex functions, mixed-integer variables, mixing set, polyhedral study, submodularity Short URL: https://optimization-online.org/?p=32717

    Article

    Download

    View PDF

    Post navigation
    Robust combinatorial optimization problems under locally budgeted interdiction uncertainty against the objective function and covering constraints
    A derivative-free trust-region approach for Low Order-Value Optimization problems
    Log in


    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity convergence rate 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.