Computational mixed-integer semidefinite programming

MaRDI QIDQ5236419zbMATH OpenFDO

Authors Tristan Gally

Publication date 15 October 2019

zbMATH Keywords

strong dualitynumerical solvermixed-integer semidefinite programmingconstraint qualification, relaxation, branch-and-boundtruss toplogy design

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11)

Recommendations

• A framework for solving mixed-integer semidefinite programs
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Semidefinite programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

Cited in

(7)

• On Integrality in Semidefinite Programming for Discrete Optimization
• A framework for solving mixed-integer semidefinite programs
• Enabling research through the SCIP Optimization Suite 8.0
• On the mixed integer signomial programming problems
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• A generic optimization framework for resilient systems
• Handling symmetries in mixed-integer semidefinite programs

Describes a project that uses

Uses Software

• SCIP-SDP

This page was built for publication: Computational mixed-integer semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236419)