Extended Formulations in Mixed-Integer Convex Programming
From MaRDI portal
Publication:3186495
DOI10.1007/978-3-319-33461-5_9zbMath1419.90078arXiv1511.06710OpenAlexW3106195685MaRDI QIDQ3186495
Emre Yamangil, Juan Pablo Vielma, Russell Bent, Miles Lubin
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06710
Convex programming (90C25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
An algorithm for nonsymmetric conic optimization inspired by MOSEK ⋮ Solving Natural Conic Formulations with Hypatia.jl ⋮ A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ Mixed-Integer Convex Representability ⋮ Strategic Workforce Planning Under Uncertainty ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Projection onto the exponential cone: a univariate root-finding problem ⋮ Least costly energy management for extended-range electric vehicles: an economic optimization framework ⋮ Mixed-integer bilevel representability ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ Algorithms for joint sensor and control nodes selection in dynamic networks ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- SCIP: solving constraint integer programs
- Differential properties of Euclidean projection onto power cone
- An algorithmic framework for convex mixed integer nonlinear programs
- Applications of second-order cone programming
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving mixed integer nonlinear programs by outer approximation
- Extended formulations in mixed integer conic quadratic programming
- A polyhedral branch-and-cut approach to global optimization
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Lectures on Modern Convex Optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- Perspective Reformulation and Applications
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Extended Formulations in Mixed-Integer Convex Programming
- Computing in Operations Research Using Julia
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Mixed-integer nonlinear optimization
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
This page was built for publication: Extended Formulations in Mixed-Integer Convex Programming
