How can I solve a minimization with 3 linear constraints?
1 visualización (últimos 30 días)
Mostrar comentarios más antiguos
I don't understand what kind of function I can use to solve the problem on photo. It's a problem with Matrix and vector, x is a vector, also E, q_B and 1 are so, while V is a Matrix. G is a scalar number which changes (but with a for loop I can do so). z and VaR are numbers.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/147428/image.jpeg)
0 comentarios
Respuestas (2)
Torsten
el 2 de Mzo. de 2015
Use MATLAB's "fmincon" to solve.
Best wishes
Torsten.
2 comentarios
Torsten
el 3 de Mzo. de 2015
Call fmincon as
x = fmincon(@myfun,x0,[],[],Aeq,beq,[],[],@(x)mycon(x,z,qb,V,a,R))
after defining Aeq and beq according to your linear constraints.
Then define mycon as
function [c,ceq]=mycon(x,z,qb,V,a,R)
c=[];
E=ones(size(x));
ceq=z*sqrt((x+qb)'*V*(x+qb))-(x+qb)'*E-V*a*R;
Best wishes
Torsten.
Johan Löfberg
el 6 de Mzo. de 2015
The formulation here looks like a bad idea. The last equality is a nonconvex equality constraints, which thus can be tricky for many solver. However, from the context, it is clear that you can relax the equality to <= (If you can obtain a lower VaR than the one specified, great, but the optimal solution will be tight, i.e., equality will hold). With an <= instead, the constraint is convex.
Using fmincon might work, but there are many solvers specialized to this sort of problems (it is a special case of second-order cone programming), such as mosek, gurobi, cplex, sdpt3,sedumi,...
In addition to that, you have modelling tools which can help you to interface these solvers, such as cvx and YALMIP.
Here is the YALMIP code to solve the problem
x = sdpvar(n,1);
Objective = x'*V*x;
Constraints = [x'*E == G, sum(x)==0, z*norm(chol(V)*(x+qb))-(x+qb)'*E <= VaR];
optimize(Constraints,Objective)
value(x)
If you have installed a solver specialized for these models, it will be used. Otherwise it will resort to fmincon.
0 comentarios
Ver también
Categorías
Más información sobre Solver-Based Nonlinear Optimization en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!