• stefsun
    了解作者
  • WINDOWS
    开发工具
  • 1.1MB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 9
    下载次数
  • 2017-11-09 10:09
    上传日期
yalmip最新文档,可在matlab中优化使用
YALMIP-master.zip
  • YALMIP-master
  • solvers
  • calldsdp5.m
    3KB
  • create_lp_solve_model.m
    1.2KB
  • calloslprog.m
    2.5KB
  • callpenlabbmi.m
    1.6KB
  • callopenopt.m
    3.4KB
  • cplex2yalmip.m
    1.5KB
  • yalmip2mosek.m
    2.9KB
  • calllinprog.m
    2.5KB
  • callglpk.m
    3.8KB
  • callpennonm.m
    5.2KB
  • yalmip2sdpt3.m
    455B
  • callmexpress.m
    2.8KB
  • callqpip.m
    1.2KB
  • callsdpt330.m
    3.1KB
  • definesolvers.m
    56.7KB
  • calllsqlin.m
    2.8KB
  • callPOP.m
    1.5KB
  • callvsdp.m
    4.2KB
  • callquadprog.m
    3.5KB
  • callsnoptgp.m
    5.7KB
  • call_xpressfico_qcmip.m
    2.3KB
  • callfiltersd.m
    2.7KB
  • callooqp.m
    2.1KB
  • callspecsdp.m
    2.6KB
  • calloptiooqp.m
    2KB
  • calllindo.m
    251B
  • callpenbmi.m
    5.8KB
  • callcbc.m
    1.5KB
  • yalmip2xpress.m
    3.3KB
  • callcplexmex.m
    2.3KB
  • callbaron.m
    5.9KB
  • call_cplexibm_miqp.m
    6.3KB
  • callnomad.m
    2.3KB
  • callipqp.m
    1.7KB
  • yalmip2pensdp.m
    500B
  • callsdpa.m
    2.1KB
  • callpowersolver.m
    1.5KB
  • callgurobi.m
    2.2KB
  • calllogdetppa.m
    4.6KB
  • callqsopt.m
    2.3KB
  • callcdd.m
    1.7KB
  • callfrlib.m
    2.1KB
  • callclp.m
    1.6KB
  • yalmip2dsdp.m
    385B
  • callintlinprog.m
    2.1KB
  • yalmip2cplex.m
    3.6KB
  • callbpmpd.m
    2KB
  • callqpoases.m
    1.7KB
  • callpensdp.m
    2.5KB
  • callsdplr.m
    5.1KB
  • callpenbmim.m
    8.1KB
  • yalmip2SDPmosek.m
    2.3KB
  • callstrul.m
    932B
  • calloptiqsopt.m
    1.5KB
  • calllmilab.m
    2.7KB
  • calllmirank.m
    2.2KB
  • callgpposy.m
    2.9KB
  • callmplcp.m
    2.3KB
  • callknitro.m
    4.5KB
  • callmaxdet.m
    6.5KB
  • callkypd.m
    4.3KB
  • callsdpt3302.m
    3.2KB
  • yalmip2powersolver.m
    232B
  • yalmip2opticsdp.m
    788B
  • callscs.m
    5.1KB
  • callqpas.m
    1.3KB
  • callpennlp.m
    5KB
  • callglpkoctave.m
    3.6KB
  • call_xpressfico_milp.m
    2.1KB
  • callipopt.m
    4.8KB
  • callsparsecolo.m
    4.4KB
  • calllindo_geo.m
    7.6KB
  • callcplexint.m
    3.6KB
  • callsdpt331.m
    3.2KB
  • callmpt.m
    4.2KB
  • callmpt3.m
    3.6KB
  • callfminsearch.m
    2.8KB
  • callscipmex.m
    3.5KB
  • callopticlp.m
    1.7KB
  • yalmip2gurobi.m
    4.2KB
  • callfmincon.m
    3.8KB
  • getavailablesolvers.m
    634B
  • yalmip2gurobimex.m
    3.7KB
  • callsdpt34.m
    8.2KB
  • callmosek.m
    14KB
  • callbintprog.m
    3.9KB
  • callpenlab.m
    2.7KB
  • calldsdp.m
    2.7KB
  • yalmip2sdpa.m
    474B
  • callsedumi.m
    4.1KB
  • callpensdpm.m
    2.7KB
  • yalmip2scs.m
    248B
  • yalmip2optidsdp.m
    843B
  • callcsdp.m
    1.7KB
  • callmexpress11.m
    2.8KB
  • yalmip2ecos.m
    854B
  • callnone.m
    315B
  • yalmip2cbc.m
    943B
内容介绍
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
评论
    相关推荐