Outer approximation with conic certificates for mixed-integer convex problems
From MaRDI portal
Publication:2195682
DOI10.1007/s12532-020-00178-3zbMath1441.90095arXiv1808.05290OpenAlexW3007427904MaRDI QIDQ2195682
Chris Coey, Juan Pablo Vielma, Miles Lubin
Publication date: 27 August 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05290
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (11)
Solving Natural Conic Formulations with Hypatia.jl ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Mixed-Integer Convex Representability ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Fill‐rate service level constrained distribution network design ⋮ Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ Cardinality-constrained distributionally robust portfolio optimization ⋮ Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization ⋮ Conic programming models for production planning with clearing functions: formulations and duality ⋮ Conflict Analysis for MINLP ⋮ Alternative regularizations for outer-approximation algorithms for convex MINLP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- SCIP: solving constraint integer programs
- An algorithmic framework for convex mixed integer nonlinear programs
- Semidefinite programming relaxations for semialgebraic problems
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Extended formulations in mixed integer conic quadratic programming
- Polyhedral approximation in mixed-integer convex optimization
- Experiments with conflict analysis in mixed integer programming
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Mixed-integer convex representability
- Lectures on Modern Convex Optimization
- CVXPY: A Python-Embedded Modeling Language for 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
- Julia: A Fresh Approach to Numerical Computing
- Sum of squares basis pursuit with linear and second order cone programming
- Extended Formulations in Mixed-Integer Convex Programming
- Computing in Operations Research Using Julia
- CSDP, A C library for semidefinite programming
- A framework for solving mixed-integer semidefinite programs
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- A Note on Performance Profiles for Benchmarking Software
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- Mixed-integer nonlinear optimization
- On Polyhedral Approximations of the Second-Order Cone
- JuMP: A Modeling Language for Mathematical Optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Outer approximation with conic certificates for mixed-integer convex problems
