Using different parsers to run the same code has different results. Is there any problem with the code?
Successive approximation method to be employed.
For improved efficiency, SDPT3 is solving the dual problem.
SDPT3 will be called several times to refine the solution.
Original size: 3199 variables, 1391 equality constraints
200 exponentials add 1600 variables, 1000 equality constraints
Status: Solved
Optimal value (cvx_optval): +0.0160707
Successive approximation method to be employed.
For improved efficiency, SeDuMi is solving the dual problem.
SeDuMi will be called several times to refine the solution.
Original size: 3199 variables, 1391 equality constraints
200 exponentials add 1600 variables, 1000 equality constraints
Thanks for your reply ,I try it ,but it doesn’t work
Successive approximation method to be employed.
For improved efficiency, Mosek is solving the dual problem.
Mosek will be called several times to refine the solution.
Original size: 3199 variables, 1391 equality constraints
200 exponentials add 1600 variables, 1000 equality constraints
Well, maybe it is infeasible. You could try removing the objective function and see whether it is still reported infeasible. Also, try to invoke CVXQUAD with MOSEK and see what happens.
Hello ,stone
when I removing the objection function (minimize 1)
I got the same result, the status is sloved with sdpt3 ,cvx_optval =1
but the sedumi and mosek infeasible
and I invoke CVXQUAD with mosek ,but there is no log function in my code
You’ll need to show your code in order for me to determine what you need to do to get CVXQUAD’'s Pade approximation to be invoked instead of CVX’s successive approximation method…
It looks like the only thing causing the successive approximation method to be invoked is exp of a CVX expression. So instead of using exp, use the exponential cone construct {x, y, z } == exponential(1) or use rel_entr, as described in mcg’s first answer at Solve optimization problems of exp function .
I don;t guarantee I didn’t miss something in your code.
this is the output of sdpt3
CVX Warning:
Models involving “rel_entr” or other functions in the log, exp, and entropy
family are solved using an experimental successive approximation method.
This method is slower and less reliable than the method CVX employs for
other models. Please see the section of the user’s guide entitled
The successive approximation method
for more details about the approach, and for instructions on how to
suppress this warning message in the future.
Using Pade approximation for exponential
cone with parameters m=3, k=3
Calling SDPT3 4.0: 6603 variables, 2795 equality constraints
For improved efficiency, SDPT3 is solving the dual problem.
num. of constraints = 2795
dim. of sdp var = 3400, num. of sdp blk = 1700
dim. of linear var = 1498
dim. of free var = 5
14 linear variables from unrestricted variable.
*** convert ublk to lblk
SDPT3: Infeasible path-following algorithms
version predcorr gam expon scale_data
HKM 1 0.000 1 0
it pstep dstep pinfeas dinfeas gap prim-obj dual-obj cputime
You edited your code post from yesterday, such that it no longer has exp. Yet you show output showing the CVXQUAD Pade approximation was invoked. So I don’t even know what you ran. Therefore I can;t diagnose your problem. It may well be that your problem is poorly posed and not reliably solved with any of these methods. Your jumbled and inconsistent mess does not help the prospects for your receiving helpful help.