A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
From MaRDI portal
Publication:2301146
Recommendations
Cites work
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- A framework for solving mixed-integer semidefinite programs
- A new branch and bound method for a discrete truss topology design problem
- A unifying framework for several cutting plane methods for semidefinite programming
- An independent benchmarking of SDP and SOCP solvers
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- Global optimization of robust truss topology via mixed integer semidefinite programming
- scientific article; zbMATH DE number 6108474 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Logistic regression: from art to science
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Polyhedral approximation in mixed-integer convex optimization
- Robust Truss Topology Design via Semidefinite Programming
- SCIP: solving constraint integer programs
- SDP relaxations for some combinatorial optimization problems
- Semidefinite optimization
- Semidefinite Programming
- Semidefinite relaxations for integer programming
- Sensor Selection via Convex Optimization
- Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks
- Solving k-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving mixed integer nonlinear programs by outer approximation
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(19)- Polyhedral approximations of the semidefinite cone and their application
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Towards understanding sensor and control nodes selection in nonlinear dynamic systems: Lyapunov theory meets branch-and-bound
- On t-branch split cuts for mixed-integer programs
- scientific article; zbMATH DE number 1953196 (Why is no real title available?)
- A framework for solving mixed-integer semidefinite programs
- scientific article; zbMATH DE number 2084777 (Why is no real title available?)
- Branch-and-cut for complementarity-constrained optimization
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Computational mixed-integer semidefinite programming
- Integer Programming and Combinatorial Optimization
- Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation
- 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
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Distributionally robust optimization of the vehicle routing problem with uncertain customers
- 50 years of mixed-integer nonlinear and disjunctive programming
Describes a project that uses
Uses Software
This page was built for publication: A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301146)
