Question: When studying the duality of Second-Order Cone Programming (SOCP) and Semidefinite Programming (SDP), it claims that both of them are self-dual. Therefore, in SOCP, (
When studying the duality of "Second-Order Cone Programming (SOCP)" and "Semidefinite Programming (SDP)", it claims that both of them are self-dual.
Therefore, in SOCP, (Qn+1)=Qn+1, and in SDP (Sn+)=Sn+.
How we can prove that?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
