Rational polyhedral outer-approximations of the second-order cone

DOI10.1016/j.disopt.2021.100643zbMath1506.90170arXiv1912.00256OpenAlexW3153362900WikidataQ114190441 ScholiaQ114190441MaRDI QIDQ2042079

Burak Kocuk

Publication date: 27 July 2021

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00256

zbMATH Keywords

mixed-integer programmingsecond-order cone programmingpolyhedral outer-approximation

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Uses Software

• LattE
• extended-MIQCP

Cites Work

• Unnamed Item
• extended-MIQCP
• Extended formulations in mixed integer conic quadratic programming
• Mixed integer programming with a class of nonlinear convex constraints
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study
• Polyhedral approximation in mixed-integer convex optimization
• Mixed-integer second-order cone programming for lower hedging of American contingent claims in incomplete markets
• Distances between optimal solutions of mixed-integer programs
• Effective lattice point counting in rational convex polytopes
• Lectures on Modern Convex Optimization
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
• A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
• On Counting Lattice Points in Polyhedra
• Sensitivity theorems in integer linear programming
• Short rational generating functions for lattice point problems
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• On largest volume simplices and sub-determinants
• New Algorithms for k-Center and Extensions
• On Polyhedral Approximations of the Second-Order Cone

This page was built for publication: Rational polyhedral outer-approximations of the second-order cone