Polyhedral approximation in mixed-integer convex optimization
From MaRDI portal
Publication:1800994
DOI10.1007/S10107-017-1191-YzbMath1401.90158arXiv1607.03566OpenAlexW3100148269MaRDI QIDQ1800994
Miles Lubin, Juan Pablo Vielma, Russell Bent, Emre Yamangil
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.03566
Related Items (16)
Learning Optimized Risk Scores ⋮ Mixed-Integer Convex Representability ⋮ The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Certifiably optimal sparse inverse covariance estimation ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ Conic programming models for production planning with clearing functions: formulations and duality ⋮ Rational polyhedral outer-approximations of the second-order cone ⋮ Partially distributed outer approximation ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DrAmpl: A meta solver for optimization problem analysis
- Enhanced mixed integer programming techniques and routing problems
- 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
- Extended formulations in mixed integer conic quadratic programming
- Constraint qualification failure in action
- A polyhedral branch-and-cut approach to global optimization
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Convex programming for disjunctive convex optimization
- Lectures on Modern Convex Optimization
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- 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
- Graph Implementations for Nonsmooth Convex Programs
- Extended Formulations in Mixed-Integer Convex Programming
- 50 Years of Integer Programming 1958-2008
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
- Mixed-integer nonlinear optimization
- JuMP: A Modeling Language for Mathematical Optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Polyhedral approximation in mixed-integer convex optimization
