function solver = definesolvers
% ****************************
% Create a default solver
% ****************************
emptysolver.tag = '';
emptysolver.version = '';
emptysolver.subversion = '';
emptysolver.checkfor= {''};
emptysolver.testcode= {''};
emptysolver.call = '';
emptysolver.subcall = '';
emptysolver.show = 1;
emptysolver.usesother = 0;
emptysolver.supportsinitial = 0;
emptysolver.supportsinitialNAN = 0;
emptysolver.supportshighprec = 0;
emptysolver.objective.linear = 0;
emptysolver.objective.quadratic.convex = 0;
emptysolver.objective.quadratic.nonconvex = 0;
emptysolver.objective.quadratic.nonnegative = 0;
emptysolver.objective.polynomial = 0;
emptysolver.objective.maxdet.convex = 0;
emptysolver.objective.maxdet.nonconvex = 0;
emptysolver.objective.sigmonial = 0;
emptysolver.constraint.equalities.linear = 0;
emptysolver.constraint.equalities.quadratic = 0;
emptysolver.constraint.equalities.polynomial = 0;
emptysolver.constraint.equalities.sigmonial = 0;
emptysolver.constraint.equalities.multiterm = 1;
emptysolver.constraint.inequalities.elementwise.linear = 0;
emptysolver.constraint.inequalities.elementwise.quadratic.convex = 0;
emptysolver.constraint.inequalities.elementwise.quadratic.nonconvex = 0;
emptysolver.constraint.inequalities.elementwise.quadratic.nonegative = 0;
emptysolver.constraint.inequalities.elementwise.polynomial = 0;
emptysolver.constraint.inequalities.elementwise.sigmonial = 0;
emptysolver.constraint.inequalities.semidefinite.linear = 0;
emptysolver.constraint.inequalities.semidefinite.quadratic = 0;
emptysolver.constraint.inequalities.semidefinite.polynomial = 0;
emptysolver.constraint.inequalities.semidefinite.sigmonial = 0;
emptysolver.constraint.inequalities.rank = 0;
emptysolver.constraint.inequalities.secondordercone.linear = 0;
emptysolver.constraint.inequalities.secondordercone.nonlinear = 0;
emptysolver.constraint.inequalities.rotatedsecondordercone = 0;
emptysolver.constraint.inequalities.powercone = 0;
emptysolver.constraint.complementarity.variable = 0;
emptysolver.constraint.complementarity.linear = 0;
emptysolver.constraint.complementarity.nonlinear = 0;
emptysolver.constraint.integer = 0;
emptysolver.constraint.binary = 0;
emptysolver.constraint.semivar = 0;
emptysolver.constraint.semiintvar = 0;
emptysolver.constraint.sos1 = 0;
emptysolver.constraint.sos2 = 0;
emptysolver.dual = 0;
emptysolver.complex = 0;
emptysolver.interval = 0;
emptysolver.parametric = 0;
emptysolver.evaluation = 0;
emptysolver.exponentialcone = 0;
emptysolver.uncertain = 0;
% **************************************
% Some standard solvers to simplify code
% **************************************
% LP solver
lpsolver = emptysolver;
lpsolver.objective.linear = 1;
lpsolver.constraint.equalities.linear = 1;
lpsolver.constraint.inequalities.elementwise.linear = 1;
lpsolver.dual = 1;
% QP solver
qpsolver = emptysolver;
qpsolver.objective.linear = 1;
qpsolver.objective.quadratic.convex = 1;
qpsolver.constraint.equalities.linear = 1;
qpsolver.constraint.inequalities.elementwise.linear = 1;
qpsolver.dual = 1;
% SDP solver
sdpsolver = emptysolver;
sdpsolver.objective.linear = 1;
sdpsolver.constraint.equalities.linear = 1;
sdpsolver.constraint.inequalities.elementwise.linear = 1;
sdpsolver.constraint.inequalities.semidefinite.linear = 1;
sdpsolver.dual = 1;
% ****************************
% INITIALIZE COUNTER
% ****************************
i = 1;
% ****************************
% DEFINE SOLVERS
% ****************************
solver(i) = qpsolver;
solver(i).tag = 'GUROBI';
solver(i).version = 'GUROBI';
solver(i).checkfor= {'gurobi'};
solver(i).call = 'callgurobi';
solver(i).constraint.inequalities.elementwise.quadratic.convex = 1;
solver(i).constraint.inequalities.secondordercone.linear = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.sos2 = 1;
solver(i).supportsinitial = 1;
solver(i).supportsinitialNAN = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'GUROBI';
solver(i).version = 'MEX';
solver(i).checkfor= {'gurobi_mex'};
solver(i).call = 'callgurobimex';
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.sos2 = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.7.1';
solver(i).checkfor= {'cplexqcp.m','cplexlink1271'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.nonconvex = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.7.1';
solver(i).checkfor= {'cplexqcp.m','cplexlink1271'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.convex = 1;
solver(i).constraint.inequalities.elementwise.quadratic.convex = 1;
solver(i).constraint.inequalities.secondordercone.linear = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.7.0';
solver(i).checkfor= {'cplexqcp.m','cplexlink1270'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.nonconvex = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.7.0';
solver(i).checkfor= {'cplexqcp.m','cplexlink1270'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.convex = 1;
solver(i).constraint.inequalities.elementwise.quadratic.convex = 1;
solver(i).constraint.inequalities.secondordercone.linear = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.6.3';
solver(i).checkfor= {'cplexqcp.m','cplexlink1263'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.nonconvex = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.6.3';
solver(i).checkfor= {'cplexqcp.m','cplexlink1263'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.convex = 1;
solver(i).constraint.inequalities.elementwise.quadratic.convex = 1;
solver(i).constraint.inequalities.secondordercone.linear = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).version = 'IBM';
solver(i).subversion = '12.6.2';
solver(i).checkfor= {'cplexqcp.m','cplexlink1262'};
solver(i).call = 'call_cplexibm_qcmiqp';
solver(i).objective.quadratic.nonconvex = 1;
solver(i).constraint.integer = 1;
solver(i).constraint.binary = 1;
solver(i).constraint.sos2 = 1;
solver(i).constraint.semivar = 1;
solver(i).constraint.semiintvar = 1;
solver(i).supportsinitial = 1;
i = i+1;
solver(i) = qpsolver;
solver(i).tag = 'CPLEX';
solver(i).v
没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论
收起资源包目录
YALMIP-R20171018.zip (1300个子文件)
findhashsorted.c 2KB
findhash.c 1KB
definesolvers.m 57KB
yalmip.m 55KB
compileinterfacedata.m 50KB
bnb.m 43KB
callmpcvx.m 39KB
sdpsettings.m 32KB
mtimes.m 32KB
branch_and_bound.m 28KB
solvebilevel.m 28KB
iterative_refinement.m 26KB
cutsdp.m 26KB
decomposeUncertain.m 25KB
sdpvar.m 25KB
dualize.m 24KB
selectsolver.m 23KB
ncvar.m 22KB
compilesos.m 20KB
lmi2sedumistruct.m 20KB
bmibnb.m 20KB
categorizeproblem.m 19KB
yalmiptest.m 17KB
solvesdp.m 16KB
subsref.m 16KB
robustify.m 15KB
expandmodel.m 15KB
callmosek.m 14KB
solvesos.m 14KB
gams2yalmip.m 14KB
norm.m 12KB
pwa_yalmip.m 12KB
expandrecursive.m 12KB
findapplicablesolvers.m 12KB
eliminatevariables.m 12KB
mpcvx.m 12KB
times.m 12KB
value.m 11KB
norm.m 11KB
optimizer.m 11KB
subsasgn.m 11KB
propagate_bounds_from_equalities.m 10KB
minus.m 10KB
solvelower.m 10KB
plus.m 10KB
generate_kernel_representation_data.m 10KB
sdisplay.m 9KB
convert_sigmonial_to_sdpfun.m 9KB
mpt_appendmodel.m 9KB
addExponentialCone.m 9KB
binmodel.m 9KB
subsref.m 9KB
filter_duality.m 8KB
lmi.m 8KB
callsdpt34.m 8KB
callpenbmim.m 8KB
pwq_yalmip.m 8KB
calllindo_nlp.m 8KB
calllindo_geo.m 8KB
check.m 8KB
kkt.m 8KB
saveampl.m 7KB
sdisplay2.m 7KB
yalmip2geometric.m 7KB
subsasgn.m 7KB
filter_enumeration.m 7KB
export.m 7KB
pwf.m 7KB
matrixcoefficients.m 7KB
monolist.m 7KB
yalmip2nonlinearsolver.m 7KB
coefficients.m 7KB
display.m 7KB
derivedualBounds.m 7KB
is.m 7KB
is.m 7KB
callmaxdet.m 6KB
callscipnl.m 6KB
setupBMIBNB.m 6KB
minus.m 6KB
plotInternalModel.m 6KB
call_cplexibm_miqp.m 6KB
convertquadratics.m 6KB
bnb_solvelower.m 6KB
convert_polynomial_to_quadratic.m 6KB
callbaron.m 6KB
display.m 6KB
rounder.m 6KB
propagatequadratics.m 6KB
setup_fmincon_params.m 6KB
callgurobimex.m 6KB
callpenbmi.m 6KB
solvemp.m 6KB
callsqplab.m 6KB
callsnoptgp.m 6KB
consistent.m 6KB
apply_recursive_differentiation.m 6KB
callfmincongp.m 6KB
mpt_enumerate_binary.m 6KB
mtimes.m 6KB
共 1300 条
- 1
- 2
- 3
- 4
- 5
- 6
- 13
资源评论
FL1623863129
- 粉丝: 1w+
- 资源: 1万+
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功