Extended formulations in mixed integer conic quadratic programming
From MaRDI portal
Publication:1688453
DOI10.1007/s12532-016-0113-yzbMath1387.90165arXiv1505.07857OpenAlexW3100301673MaRDI QIDQ1688453
Miles Lubin, Joey Huchette, Juan Pablo Vielma, Iain Dunning
Publication date: 8 January 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07857
Related Items (17)
Exact approaches for competitive facility location with discrete attractiveness ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Unnamed Item ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Outer approximation and submodular cuts for maximum capture facility location problems with random utilities ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Reformulations for utilizing separability when solving convex MINLP problems ⋮ Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra ⋮ Rational polyhedral outer-approximations of the second-order cone ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Partially distributed outer approximation ⋮ extended-MIQCP ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Sparse regression at scale: branch-and-bound rooted in first-order optimization
Uses Software
Cites Work
- Unnamed Item
- Mixed-integer nonlinear programs featuring ``on/off constraints
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Algorithm for cardinality-constrained quadratic optimization
- An algorithmic framework for convex mixed integer nonlinear programs
- Applications of second-order cone programming
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Optimization of cardinality constrained portfolios with a hybrid local search algorithm
- Heuristics for cardinality constrained portfolio optimization
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- A polyhedral branch-and-cut approach to global optimization
- Computational study of a family of mixed-integer quadratic programming problems
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Portfolio optimization with linear and fixed transaction costs
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Generalized Benders decomposition
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Lectures on Modern Convex Optimization
- Projected Perspective Reformulations with Applications in Design Problems
- 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
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Computing in Operations Research Using Julia
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- On Polyhedral Approximations of the Second-Order Cone
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Benchmarking optimization software with performance profiles.
This page was built for publication: Extended formulations in mixed integer conic quadratic programming
