Pages that link to "Item:Q1800994"
From MaRDI portal
The following pages link to Polyhedral approximation in mixed-integer convex optimization (Q1800994):
Displayed 16 items.
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Conic programming models for production planning with clearing functions: formulations and duality (Q2030464) (← links)
- Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- Learning Optimized Risk Scores (Q5214243) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)