登录
首页 » matlab » YALMIP

YALMIP

于 2014-11-25 发布 文件大小:936KB
0 234
下载积分: 1 下载次数: 23

代码说明:

  YALMIP工具箱,内含各种函数,可用来求解部分线性规划,非线性规划,及混合规划的matlab工具箱。(YALMIP toolbox, containing a variety of functions that can be used to solve part of the linear programming, nonlinear programming, and mixed planning matlab toolbox.)

文件列表:

yalmip
......\@sdpvar
......\.......\abs.m,2446,2010-04-28
......\.......\acos.m,1325,2010-04-28
......\.......\acosh.m,924,2010-04-28
......\.......\acot.m,918,2010-04-28
......\.......\addfactors.asv,2117,2010-04-28
......\.......\addfactors.m,2657,2010-04-28
......\.......\addgkyp.m,843,2010-04-28
......\.......\addleftfactor.m,271,2010-04-28
......\.......\addrightfactor.m,212,2010-04-28
......\.......\and.m,2413,2010-04-28
......\.......\any.m,222,2010-04-28
......\.......\asec.m,925,2010-04-28
......\.......\asin.m,933,2010-04-28
......\.......\asinh.m,876,2010-04-28
......\.......\assign.m,1658,2010-04-28
......\.......\atan.m,902,2010-04-28
......\.......\beta.m,841,2010-04-28
......\.......\binary.m,869,2010-04-28
......\.......\blkdiag.m,3113,2010-04-28
......\.......\bounds.m,1191,2010-04-28
......\.......\brutepersp.m,300,2010-04-28
......\.......\cat.m,278,2010-04-28
......\.......\ceil.m,1213,2010-04-28
......\.......\circshift.m,424,2010-04-28
......\.......\clean.m,975,2010-04-28
......\.......\cleandoublefactors.m,836,2010-04-28
......\.......\clearsdpvar.m,406,2010-04-28
......\.......\clear_poly_dep.m,277,2010-04-28
......\.......\cone.m,904,2010-04-28
......\.......\conj.m,214,2010-04-28
......\.......\Contents.m,6673,2010-04-28
......\.......\conv.m,673,2010-04-28
......\.......\convexhull.m,40,2010-04-28
......\.......\cos.m,1849,2010-04-28
......\.......\cosh.m,982,2010-04-28
......\.......\cot.m,705,2010-04-28
......\.......\ctranspose.m,467,2010-04-28
......\.......\ctransposefactor.m,274,2010-04-28
......\.......\cut.m,739,2010-04-28
......\.......\deadhub.m,1665,2010-04-28
......\.......\degreduce.m,628,2010-04-28
......\.......\degree.m,1807,2010-04-28
......\.......\depends.m,496,2010-04-28
......\.......\det.m,1168,2010-04-28
......\.......\diag.m,739,2010-04-28
......\.......\diff.m,2037,2010-04-28
......\.......\display.m,6595,2010-04-28
......\.......\domain.m,925,2010-04-28
......\.......\double.m,9154,2010-04-28
......\.......\eig.m,917,2010-04-28
......\.......\eliminateBinary.m,479,2010-04-28
......\.......\end.m,536,2010-04-28
......\.......\eq.m,282,2010-04-28
......\.......\erf.m,2408,2010-04-28
......\.......\erfc.m,861,2010-04-28
......\.......\erfcx.m,779,2010-04-28
......\.......\erfinv.m,923,2010-04-28
......\.......\exp.m,1343,2010-04-28
......\.......\expanded.m,215,2010-04-28
......\.......\exponents.m,415,2010-04-28
......\.......\extractkyp.m,282,2010-04-28
......\.......\factors.m,176,2010-04-28
......\.......\false.m,378,2010-04-28
......\.......\find.m,102,2010-04-28
......\.......\fix.m,1554,2010-04-28
......\.......\fliplr.m,340,2010-04-28
......\.......\flipud.m,340,2010-04-28
......\.......\floor.m,903,2010-04-28
......\.......\flush.m,86,2010-04-28
......\.......\flushmidfactors.m,166,2010-04-28
......\.......\ge.m,282,2010-04-28
......\.......\generateAB.m,942,2010-04-28
......\.......\geomean.m,4433,2010-04-28
......\.......\getbase.m,215,2010-04-28
......\.......\getbasematrix.m,465,2010-04-28
......\.......\getbasematrixwithoutcheck.m,298,2010-04-28
......\.......\getbasevectorwithoutcheck.m,271,2010-04-28
......\.......\gethackflag.m,197,2010-04-28
......\.......\getsosrank.m,185,2010-04-28
......\.......\getvariables.m,1297,2010-04-28
......\.......\getvariablesvector.m,261,2010-04-28
......\.......\gkyp.m,895,2010-04-28
......\.......\gt.m,281,2010-04-28
......\.......\hankel.m,507,2010-04-28
......\.......\homogenize.m,842,2010-04-28
......\.......\horzcat.m,3851,2010-04-28
......\.......\imag.m,815,2010-04-28
......\.......\imag2real.m,926,2010-04-28
......\.......\integer.m,877,2010-04-28
......\.......\invsathub.m,4241,2010-04-28
......\.......\is.m,5968,2010-04-28
......\.......\isconvex.m,1112,2010-04-28
......\.......\isequal.m,466,2010-04-28
......\.......\ishermitian.m,799,2010-04-28
......\.......\isinteger.m,236,2010-04-28
......\.......\isinterval.m,178,2010-04-28
......\.......\islinear.m,730,2010-04-28
......\.......\ismember.m,2673,2010-04-28

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • jih
    matlab,Mathimatics-Numerical algorithms
    2010-08-30 16:25:44下载
    积分:1
  • AlbedoToolbox-1.0
    大气模型计算,本软件可实现计算不同高度的密度、气压等参数。(Atmospheric model calculations, the software can realize a high degree of different density, pressure and other parameters.)
    2008-08-22 19:15:36下载
    积分:1
  • yichuan
    递归遗传算法,可以非常有效的对神经网络的结构和初始权值进行优化。(Recursive genetic algorithm, can be very effective on the neural network structure and initial weights are optimized.)
    2020-11-14 16:09:42下载
    积分:1
  • G.723.1-v2r1a.tar
    ITU-T G.723.1 Speech Coder: Matlab implementation This package implements the speech coder and decoder. Full documentation is in the PDF file included with the package. The test folder has test programs for the coder and decoder (for Windows).
    2008-03-11 23:19:30下载
    积分:1
  • OFDMwithwindowing
    基于ofdm的窗口技术。。。。。。。。。。。(OFDM with windowing)
    2011-12-15 21:46:30下载
    积分:1
  • sso_simple
    Simplified Swarm Optimization Algorithm
    2013-05-12 22:33:09下载
    积分:1
  • 665-965-1-PB
    STUDY OF VARIOUS NOISE MODEL AND FILTERING TECHNIQUES
    2014-11-09 02:53:12下载
    积分:1
  • GMGA
    GMGA 用大变异遗传算法求解一维无约束优化问题 (GMGA large variation genetic algorithm to solve the one-dimensional unconstrained optimization problem)
    2012-12-03 23:14:57下载
    积分:1
  • mreg
    matlab程序中的部分经典算法,仅供参考(matlab program, part of the classical algorithm for reference only)
    2009-09-17 09:17:20下载
    积分:1
  • matlab_3_opt
    提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
    2007-09-20 19:35:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载