如何用matlab编写如下程序？急求-经管之家官网！

首先，我对matlab软件不熟悉。我想请教一下资深的软件使用者，我的这个构想能否用matlab编程实现？
我目前要写一篇本科毕业论文，其中主要要用马尔科夫模型求概率转移矩阵。这个我知道可以实现，关键是计算概率转移矩阵的生成元，为此，需要利用最大似然估计估计每个矩阵元素，对数求导后得出一个2次规划：
[draw]a11i22c1a22b1a2281c22421122421722421e22422322422622422922622f22723122823322b23422c23522e234a11i23721824921824a21824c217251217254217257217a11i23f21c23e22123d22423d22723a22b23422d23022e22f22e22d22ea11i24621d24622524522924522f24523424723424b23424d23424f23425323425423425322ea11i23b210240182421224211245172471a2471e24921024a210a11i25b22f25c22d25e22d26222d26122d26122f25f23325e23625e238261238264238265238265235a11i26122625f22626122626222625f22825f22925f22725f22625e226a11i26f23826d23c26b23e26a23fa11i27b22827d22527d22427e22127d22827d22c27d22f27d23527c23727c23827c23927a238277237276236a11i27c21d27c21f27a21f27921f27921e27a21ea11i271233272235273235274237274238275238276238a11i2841d28a1f28c21428d21928e21f29022329022829022c29022e29023328d23428b23528a235289235a11i2a421c2a521c2d821b2e221ba11i2a42302bb22f2cd22f2d022f2d522f2db22f2e022fa11i2f921c2fb2192fc2162f92102f41e2eb2102e72152e42232e42292e522f2e92362ef2392f42352f822f2f82292f82232f821e2f82192f82142fa21f2fa2272fc22e3103237310723b310c23b31102363112234a11i310321d310421d310f216311221431142123116212311621d31162243117228311722d31172333117238311723c31172343117230311722e311722c311722731172253117223311b21f311f21d312321d312721d312921d312b21da11i313b216313a21131381f31361f3131214312f21b312e221312e228312e22c313322c31382293139226313a221313a21c313a218313a215313a225313a22e313a235313a23e313a244313924731372483131244312a23ca11i31402193140217a11i3140214314121b314121d31412213141226314122f3141238314123c3143233314322b314621f314921b314e21b314e228314e231314e23c314e240314e237314e22f314e227315021e315521b315921b3159226315922d3159236315923c315a23d315d23d31612393164236a11i31712233170221316f21f316d21e316621e316421f3160227316022f31602313160234316023631642363167236316a235316d230316e22b316f225316f223317223531742403175243317c2433180241318123fa11i317121231722163178224317c22e317d235318123c31852413186241a11i31891d3187211318021e317d2263179233317423c317123ca11i3188219318a21931a721931ab21931af21931b421931ab21fa11i3187218318c21b3198225319922531972263194229319222f318f234318e236318d238318c23c318a23e3189241318f241319c24131a324131a924131ae24131b0241a11i31a423031a523031a823531ab23731ab23b31ad23d31ae23e31b0240a11i31991731992143199219a11i319819319e1f319f21431a021631a021831a621131a71c31a71a31a71731a7163
其中[draw]a11i26223f26a23f27923f27c23f28623f28923f28b23f28d23fa11i27524027524827524f27325b26d26226726226626226526026425b264257a11i28324128324b28325628325d28326028426328c263290263292263a11i29525829525e295262295264a11i2a42572ab2542ad2502ac2572ac25c2ac2602ac2632ad2632b125f2b425b2b2258a11i2ad24d2ac24da11i2ba2582bb25e2bb2632bb265a11i2bc25b2ba2602ba2652b92662b72672b42672b3267a11i2cb2582d02522d124e2d12552d125a2d125d2d12602cf2642cb2662c92672c925fa11i2d124c2cd24b[/draw]是一步转移概率矩阵的元素，n代表基金种类中的第n种基金，k代表基金所处状态的个数，draw]a11i29425329224f28b24f28825028325227d25627a25c27a26427a26a27a26f27a27228127428927429127429627429b27429c27829c27d29c28329c28629b28c29429228e29328529327e28b27c286a11i2a92882ab2842ad2802ad27e2ad2842ad2862ad28a2ad28d2ad28f2ad2932ad2952ad2952b12932b32912b328da11i2a92782aa2782ab2782aa2772a827aa11i2c128f2ba2972b7297a11i2c52862cc27f2cc27d2cc27a2cc2772cc27d2cc2822cc2852cc28d2cc2952cc2992cb2992ca2992c72952c5293a11i2c72702c82722c82732ca26fa11i2b12432ac24b2ac2522ac25a2ac25d2ad25fa11i2b324e2b32572b325b2b325d2b325e2b52552b72522bc24c2c024c2c224c2c224d2c22502c22542c22572c225b2c225e2c525e2c925c2cc257a11i2d22452d324d2d32522d32542d32572d225a2d225e2d1260[/draw]代表第n种基金在一步转移中有状态i转移到状态j的次数，这个次数的取值是大于等于0,且小于等于36.
所以这是一个非线性规划约束问题，最好是利用SQP(序列二次规划方法）估计概率转移矩阵的元素，我想请问这个如何实现？可能性方面我已经确定这完全可行，就是想问下大体思路该怎么做，有好的思路的话我不介意悬赏。万分感谢所有解答我的问题的人。