In my cvx formulation the variable is a 3 dimension matrix: A(n,n,p)

with n=22 and p=50 CVX find the optimal result but as i increase the p by 2 (p=52) CVX return following answer:

Calling Mosek 7.1.0.12: 29584 variables, 25986 equality constraints

MOSEK Version 7.1.0.12 (Build date: 2014-12-12 11:23:25)

Copyright Β© 1998-2014 MOSEK ApS, Denmark. WWW: http://mosek.com

Platform: Windows/64-X86

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24078).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24078).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24079).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24079).

MOSEK warning 52: A numerically large lower bound value -1.1e+010 is specified for constraint ββ (24100).

MOSEK warning 53: A numerically large upper bound value -1.1e+010 is specified for constraint ββ (24100).

MOSEK warning 52: A numerically large lower bound value -1.1e+010 is specified for constraint ββ (24101).

MOSEK warning 53: A numerically large upper bound value -1.1e+010 is specified for constraint ββ (24101).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24122).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24122).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24123).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24123).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24144).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24144).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24145).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24145).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24166).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24166).

MOSEK warning 52: A numerically large lower bound value -1.1e+009 is specified for constraint ββ (24167).

MOSEK warning 53: A numerically large upper bound value -1.1e+009 is specified for constraint ββ (24167).

Warning number 52 is disabled.

Warning number 53 is disabled.

MOSEK warning 57: A large value of 2.3e+010 has been specified in cx for variable ββ (0).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28556).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28557).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28558).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28559).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28560).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28561).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28562).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28563).

MOSEK warning 57: A large value of 1.1e+008 has been specified in cx for variable ββ (28564).

Warning number 57 is disabled.

Computer

Platform : Windows/64-X86

Cores : 4

Problem

Name :

Objective sense : min

Type : LO (linear optimization problem)

Constraints : 25986

Cones : 0

Scalar variables : 29584

Matrix variables : 0

Integer variables : 29040

Optimizer started.

Mixed integer optimizer started.

Optimizer - threads : 4

BRANCHES RELAXS ACT_NDS BEST_INT_OBJ BEST_RELAX_OBJ REL_GAP(%) TIME

Objective of best integer solution : Not available.

Best objective bound : Not available.

Construct solution objective : Not employed

Construct solution # roundings : 0

User objective cut value : 0

Number of cuts generated : 0

Number of branches : 0

Number of relaxations solved : 0

Number of interior point iterations: 0

Number of simplex iterations : 0

Time spend presolving the root : 0.13

Time spend in the heuristic : 0.00

Time spend in the sub optimizers : 0.00

Time spend optimizing the root : 0.00

Mixed integer optimizer terminated. Time: 0.22

Optimizer terminated. Time: 0.30

Integer solution solution summary

Problem status : PRIMAL_INFEASIBLE

Solution status : UNKNOWN

Primal. obj: 0.0000000000e+000 Viol. con: 1e+010 var: 0e+000 itg: 0e+000

Optimizer summary

Optimizer - time: 0.30

Interior-point - iterations : 0 time: 0.00

Basis identification - time: 0.00

Primal - iterations : 0 time: 0.00

Dual - iterations : 0 time: 0.00

Clean primal - iterations : 0 time: 0.00

Clean dual - iterations : 0 time: 0.00

Clean primal-dual - iterations : 0 time: 0.00

Simplex - time: 0.00

Primal simplex - iterations : 0 time: 0.00

Dual simplex - iterations : 0 time: 0.00

Primal-dual simplex - iterations : 0 time: 0.00

Mixed integer - relaxations: 0 time: 0.22

Status: Infeasible

Optimal value (cvx_optval): +Inf

I have to increase the p value by 300 or 500 what should i do?