How to solve a general second-order cone programming (SOCP) use YALMIP?

[myathappy]

Dear Prof.Johan Löfberg

       I want to solve a  second-order cone programming (SOCP) problem. which general form of SOCP  is 

                                                                                       c                                                                                                                            T                                                                            min      x

(1)

∥Ax+b∥2≤cTx+d

where A∈Rm×n and c∈Rn. Where the constraint is one (or multiple ) cone and may have other equality constraints.

   However, the tutorial in https://yalmip.github.io/tutorial/socpprogramming/, the  objective is a norm of matrix.

  I would like to know how I should translate problem (1)  to codes with YALMIP language. Could you give a example codes of general SOCP problem if possible.

Thanks

[Johan Löfberg]

In what sense is this general? This is as basic as it gets

constraints = [norm(A*x+b)<= c'*x+d]

objective = c'*x;

optimize(constraints, objective)

[myathappy]

ah,that is just the problem I want to solve. I'll try is as you suggest. Thank you professor.