Discussion Overview
The discussion revolves around the use of the SeDuMi function for solving semidefinite optimization problems. Participants also explore the distinctions between second order cone programming (SOCP) and semidefinite quadratic linear programming.
Discussion Character
- Exploratory, Technical explanation, Debate/contested
Main Points Raised
- One participant requests assistance in creating a SeDuMi function for semidefinite optimization and seeks clarification on differentiating between SOCP and semidefinite quadratic linear programming.
- Another participant mentions that K.s is used for semidefinite constraints and K.q for SOCP cones, suggesting that the data for SOCP cones is organized differently from that of SDPs.
- A suggestion is made to use a modeling language like YALMIP to avoid dealing with the complexities of SeDuMi.
- There is a brief exchange questioning the identity of a participant, with one expressing surprise at the presence of someone they believe to be Lofberg.
Areas of Agreement / Disagreement
The discussion includes multiple viewpoints regarding the use of SeDuMi and the distinctions between optimization types, with no consensus reached on the best approach or understanding of the differences.
Contextual Notes
Some assumptions about familiarity with optimization terminology and software are present, which may limit understanding for those less experienced in the field.