A framework for solving mixed-integer semidefinite programs
From MaRDI portal
(Redirected from Publication:4637832)
Recommendations
- Computational mixed-integer semidefinite programming
- An algorithmic framework for convex mixed integer nonlinear programs
- Semidefinite relaxations for integer programming
- scientific article; zbMATH DE number 1424224
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A novel approach for solving semidefinite programs
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Semidefinite programming and integer programming
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- A solution framework for linear PDE-constrained mixed-integer problems
Cites work
- A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A Spectral Bundle Method for Semidefinite Programming
- A tree-search algorithm for mixed integer programming problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Algorithm 875
- An Automatic Method of Solving Discrete Programming Problems
- An evolutionary algorithm for polishing mixed integer programming solutions
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Benchmarking optimization software with performance profiles.
- Branching rules revisited
- Conic mixed-integer rounding cuts
- Cuts for mixed 0-1 conic programming
- DINS, a MIP Improvement Heuristic
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Fixing Variables in Semidefinite Relaxations
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1332666 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1534290 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 2086928 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 3239575 (Why is no real title available?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- LAPACK Users' Guide
- Local branching
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Material interpolation schemes in topology optimization
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On the complexity of semidefinite programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Regularizing the abstract convex program
- RENS. The optimal rounding
- Robust optimization
- Robust Truss Topology Design via Semidefinite Programming
- SCIP: solving constraint integer programs
- SDP relaxations for some combinatorial optimization problems
- Semidefinite optimization
- Semidefinite relaxations for integer programming
- 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
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Sparse learning via Boolean relaxations
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- The node capacitated graph partitioning problem: A computational study
- Warm start of the primal-dual method applied in the cutting-plane scheme
Cited in
(27)- A solution framework for linear PDE-constrained mixed-integer problems
- Sensor scheduling for linear systems: A covariance tracking approach
- 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
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Irreducible infeasible subsystems of semidefinite systems
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- Exploiting Solving Phases for Mixed-Integer Programs
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Mixed-integer convex representability
- Computational mixed-integer semidefinite programming
- A generic optimization framework for resilient systems
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Handling symmetries in mixed-integer semidefinite programs
- 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
- Cardinality minimization, constraints, and regularization: a survey
- Enabling research through the SCIP Optimization Suite 8.0
- Beyond symmetry: best submatrix selection for the sparse truncated SVD
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Distributionally robust optimization of the vehicle routing problem with uncertain customers
- Convex mixed-integer optimization with Frank-Wolfe methods
- A positive semidefinite safe approximation of multivariate distributionally robust constraints determined by simple functions
- Instance-specific linear relaxations of semidefinite optimization problems
- 50 years of mixed-integer nonlinear and disjunctive programming
This page was built for publication: A framework for solving mixed-integer semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637832)
