A framework for solving mixed-integer semidefinite programs
From MaRDI portal
Publication:4637832
DOI10.1080/10556788.2017.1322081zbMath1398.90109OpenAlexW2527757967MaRDI QIDQ4637832
Tristan Gally, Marc E. Pfetsch, Stefan Ulbrich
Publication date: 3 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1322081
Semidefinite programming (90C22) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
A generic optimization framework for resilient systems, Mixed-Integer Convex Representability, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, Handling symmetries in mixed-integer semidefinite programs, Irreducible infeasible subsystems of semidefinite systems, Cardinality-constrained distributionally robust portfolio optimization, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, On Integrality in Semidefinite Programming for Discrete Optimization, Outer approximation with conic certificates for mixed-integer convex problems, Certifiably optimal sparse inverse covariance estimation, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization, Unnamed Item, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Sensor scheduling for linear systems: A covariance tracking approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- SCIP: solving constraint integer programs
- RENS. The optimal rounding
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Conic mixed-integer rounding cuts
- Regularizing the abstract convex program
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- The node capacitated graph partitioning problem: A computational study
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Warm start of the primal-dual method applied in the cutting-plane scheme
- On the complexity of semidefinite programs
- Local branching
- Material interpolation schemes in topology optimization
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Branching rules revisited
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- Sparse learning via Boolean relaxations
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Cuts for mixed 0-1 conic programming
- SDP Relaxations for Some Combinatorial Optimization Problems
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- An Automatic Method of Solving Discrete Programming Problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Semidefinite optimization
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Algorithm 875
- Semidefinite Relaxations for Integer Programming
- LAPACK Users' Guide
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Robust Truss Topology Design via Semidefinite Programming
- A Spectral Bundle Method for Semidefinite Programming
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Fixing Variables in Semidefinite Relaxations
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- DINS, a MIP Improvement Heuristic
- A tree-search algorithm for mixed integer programming problems
- Benchmarking optimization software with performance profiles.
