sdmguide.ps

这是matlab解2阶锥工具包

(be)f(declared)g(taking)f(into)h(account)f(a)i(block)e(partitioning.)
102 471 y Fn(1.3)50 b(Existing)12 b(solvers)102 593 y
FA(Se)o(v)o(eral)d(research)h(groups)e(ha)o(v)o(e)h(produced)f
(software)g(packages)h(for)g(SDP)h(problems)e(and)h(man)o(y)g(impro)o
(v)o(ements)g(are)102 650 y(currently)h(made.)15 b(Among)10
b(the)h(\002rst)f(solv)o(ers)g(were)i(the)e(SP)i(solv)o(er)f([28)o(])g
(and)g(the)g(LMI-lab)g(which)f(e)o(v)o(olv)o(ed)g(into)g(the)103
706 y(M)r Fz(A)n(T)r(L)r(A)r(B)16 b FA(LMI)d(Control)e(T)l(oolbox)g
([13)o(].)18 b(Since)12 b(then,)g(a)h(wide)f(v)o(ariety)f(of)h(solv)o
(ers)g(ha)o(v)o(e)g(been)g(de)o(v)o(eloped)g(among)102
763 y(which:)h(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)i
FA([25)o(],)d(SDP)l(A)e([12],)h(SDPHA)g([7],)h(SDPpack)f([1)o(],)h
(SDPT3)e([26],)i(CSDP)f([5,)g(4],)g(CUTSDP)g([16],)102
819 y(DSDP)16 b([3,)g(2].)29 b(This)15 b(list)f(is)i(not)f(e)o(xhausti)
o(v)o(e.)28 b(All)15 b(solv)o(ers)g(ha)o(v)o(e)h(particularities.)27
b(The)o(y)16 b(ha)o(v)o(e)g(their)g(o)o(wn)f(SDP)102
876 y(formalism,)i(their)e(options,)g(their)g(potentialities,)g(their)g
(con)n(v)o(er)o(gence)h(speed,)h(their)e(rob)o(ustness...)27
b(F)o(or)16 b(a)g(recent)102 932 y(comparison)10 b(of)h(these)g(solv)o
(ers)g(see)g([20].)102 1024 y(Ha)o(ving)j(ourselv)o(es)g(tested)g(some)
h(of)g(the)g(solv)o(ers)f(and)h(in)f(vie)o(w)h(of)g(the)f(report)h
([20],)h(we)f(came)i(to)d(the)h(choice)g(of)103 1080
y(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)q FA(.)i(The)11
b(adv)o(antages)f(of)h(this)f(solv)o(er)h(that)f(guided)h(our)g(choice)
g(are:)170 1207 y Fp(\017)22 b FA(Asymptotic)10 b(computational)g
(comple)o(xity)m(.)15 b(Let)c Fw(n)h FA(be)f(the)h(number)f(of)h
(decision)e(v)o(ariables)h(and)g Fw(m)h FA(the)f(num-)215
1264 y(ber)j(of)g(ro)o(ws)g(of)g(the)f(LMIs.)23 b(The)14
b(computational)e(comple)o(xity)h(of)i(S)r Fz(E)r FA(D)r
Fz(U)r FA(M)r Fz(I)i FA(\(including)12 b(main)i(and)g(inner)215
1320 y(iterations\))8 b(is)h(in)g Fw(O)p Fq(\()p Fw(n)568
1304 y FI(2)586 1320 y Fw(m)619 1304 y FI(2)p Fs(:)p
FI(5)668 1320 y Fq(+)c Fw(m)741 1304 y FI(3)p Fs(:)p
FI(5)786 1320 y Fq(\))k FA(while)g(the)g(algorithm)g(in)g([13)o(])h
(has)g(a)f(comple)o(xity)g Fw(O)p Fq(\()p Fw(n)1694 1304
y FI(3)1712 1320 y Fw(m)p Fq(\))p FA(.)k(The)d(former)215
1377 y(algorithm)g(is)g(more)h(ef)o(\002cient)f(for)h(problems)f(with)g
(a)g(lar)o(ge)h(number)g(of)f(v)o(ariables.)k(This)9
b(is)h(of)h(major)g(interest)215 1433 y(when)k(solving)f(lar)o(ge)i
(scale)f(problems)g(or)h(when)f(implementing)f(LMI-based)i(iterati)o(v)
o(e)e(algorithms)g(as)i(in)215 1489 y([11,)c(15)o(,)g(21)o(,)g(14)o(,)g
(18].)170 1582 y Fp(\017)22 b FA(Sparse)13 b(format.)19
b(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)d FA(takes)c(the)g(SDP)h
(problem)f(data)g(in)g(sparse)g(format.)19 b(Therefore,)13
b(the)f(disk)f(space)215 1639 y(memory)k(needed)g(for)g(de\002ning)e
(problems)h(is)g(reduced)h(in)f(the)g(case)h(of)f(structured)g(data.)24
b(The)14 b(results)g(are)215 1695 y(satisfying)9 b(for)j(automatic)e
(control)h(problems)f(for)h(which)g(most)g(of)g(the)g(data)g(are)h
(sparse.)170 1788 y Fp(\017)22 b FA(Lar)o(ge)16 b(scale)g(problems.)28
b(This)15 b(remark)h(is)g(closely)e(related)i(to)f(the)h(two)f(pre)o
(vious)f(ones.)28 b(It)15 b(appears)h(that)216 1845 y(S)r
Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)e FA(is)c(quite)f(competiti)o(v)o(e)g
(for)i(medium-size)f(problems)f(and)h(can)h(solv)o(e)e(relati)o(v)o
(ely)h(lar)o(ge-scale)g(prob-)215 1901 y(lems.)170 1994
y Fp(\017)22 b FA(Comple)o(x)13 b(v)o(alued)e(problems.)16
b(Both)c(the)g(data)g(and)g(the)g(v)o(ariables)f(may)h(be)h(gi)o(v)o
(en)e(or)h(constrained)f(with)g(real)215 2050 y(or)f(comple)o(x)g(v)o
(alues.)j(At)d(the)g(dif)o(ference)g(of)g([8],)h(this)e(is)g(done)h
(without)e(increasing)h(the)h(size)g(of)g(the)g(problem.)170
2143 y Fp(\017)22 b FA(Equality)15 b(constraints.)29
b(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)21 b FA(allo)o(ws)15
b(to)h(declare)h(e)o(xplicitely)e(linear)h(equality)f(constraints)f
(without)215 2200 y(computing)c(an)o(y)h(kernel)g(or)g(arti\002cially)f
(de\002ning)h(an)g(equality)f(as)h(two)f(opposite-side)f(inequalities.)
170 2292 y Fp(\017)23 b FA(M)r Fz(A)n(T)r(L)r(A)r(B)q
FA(.)18 b(Most)11 b(of)g(the)g(researchers)g(in)g(the)g(control)f
(community)h(are)h(used)e(to)h(work)f(with)h(M)r Fz(A)n(T)r(L)r(A)r(B)q
FA(.)18 b(It)11 b(is)215 2349 y(therefore)h(attracti)o(v)o(e)e(to)h(ha)
o(v)o(e)h(a)f(tool)f(that)h(can)g(be)h(used)e(within)g(the)i(M)r
Fz(A)n(T)r(L)r(A)r(B)j FA(en)n(vironment.)170 2442 y
Fp(\017)22 b FA(Free)10 b(software.)k(S)r Fz(E)r FA(D)r
Fz(U)r FA(M)r Fz(I)f FA(is)c(de)o(v)o(eloped)f(with)g(an)h(open)g
(source)g(free)g(software)g(polic)o(y)f(as)h(well)g(as)h(S)r
Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)216 2498 y FA(I)r Fz(N)r(T)r(E)r(R)r
(F)o(A)r(C)r(E)q FA(.)22 b(W)l(e)13 b(hope)f(this)f(will)g(encourage)i
(the)f(scienti\002c)g(community)f(to)h(support)f(and)h(follo)o(w)g(up)g
(this)215 2555 y(initiati)o(v)o(e.)170 2648 y Fp(\017)22
b FA(Potentialities.)12 b(In)g(S)r Fz(E)r FA(D)r Fz(U)r
FA(M)r Fz(I)k FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)q(C)s(E)f
FA(we)c(mainly)g(took)f(adv)o(antage)g(of)h(SDP)g(programming.)j(But)e
(S)r Fz(E)r FA(-)216 2704 y(D)r Fz(U)r FA(M)r Fz(I)j
FA(has)c(other)h(potentialities)o(.)i(It)d(can)h(deal)g(simultaneously)
d(with)i(linear)g(programming)h(and)f(quadratic)215 2760
y(cones.)19 b(These)12 b(potentialities)e(will)h(be)i(inte)o(grated)f
(into)h(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)k FA(I)r
Fz(N)r(T)r(E)r(R)r(F)o(A)r(C)r(E)g FA(in)12 b(the)h(future,)g
(depending)215 2817 y(on)e(possible)e(feedback)j(remarks.)1035
2951 y(4)p eop
%%Page: 5 6
5 5 bop -98 -80 a Fn(1.4)50 b(Existing)12 b(Interfaces)-98
42 y FA(Quite)i(fe)o(w)h(LMI)g(interfaces)f(for)h(SDP)g(solv)o(ers)f
(are)h(a)o(v)o(ailable.)24 b(The)14 b(most)g(famous)g(is)g(the)h
(software)e(in)h(the)h(LMI)-98 99 y(Control)e(T)l(oolbox)e([13].)21
b(Then)13 b(comes)g(the)g(sdpsol)f(software)g([29],)i(which)f(is)f
(associated)h(to)f(the)h(SP)h(solv)o(er)f([28],)-98 155
y(and)g(the)f(LMIT)o(OOL)g(package)h([9)o(],)h(which)e(calls)g(three)g
(dif)o(ferent)g(solv)o(ers:)j(SP)f([28)o(],)g(SDPHA)e([7])h(and)f(SDPP)
o(ack)-98 212 y([1].)j(All)10 b(three)h(interfaces)g(work)f(in)i(M)r
Fz(A)n(T)r(L)r(A)r(B)k FA(en)n(vironment.)-98 303 y(Except)e(the)h
(plurality)e(of)h(the)h(solv)o(ers,)g(the)f(dif)o(ference)h(between)f
(these)g(three)h(interfaces)f(is)g(the)h(way)f(LMCs)h(are)-98
360 y(declared.)g(The)o(y)10 b(all)h(adopt)e(dif)o(ferent)i
(formalisms.)j(LMIT)o(OOL)c(is)g(purely)g(a)h(graphical)f(user)h
(interface)f(\(GUI\))h(tool)-98 416 y(and)g(is)g(nice)g(and)g(con)n(vi)
o(vial.)h(As)f(a)g(by-product,)g(the)f(transformation)g(of)h(data)g
(into)f(the)h(v)o(arious)f(solv)o(er)h(formalisms)-98
473 y(is)i(quite)g(slo)o(w)m(.)20 b(The)13 b(LMC)h(problems)f(are)h
(often)f(faster)g(solv)o(ed)g(than)f(con)n(v)o(erted)i(to)f(the)g(con)n
(v)o(enient)f(format.)22 b(F)o(or)-98 529 y(the)14 b(sdpsol)f
(interface,)h(the)g(speed)g(results)f(are)i(less)e(patent.)22
b(The)14 b(LMIs)h(are)f(declared)h(in)e(a)i(te)o(xt)e(\002le)i(in)e(a)i
(natural)-98 586 y(way)m(.)23 b(The)o(y)15 b(are)g(then)e(interpreted)h
(by)g(the)g(interface.)23 b(The)14 b(speed)g(of)g(the)g(interpretation)
f(is)h(more)h(ef)o(\002cient)f(than)-98 642 y(for)i(LMIT)o(OOL)f(b)o
(ut)f(still)f(is)i(not)f(con)n(v)o(enient)h(for)g(lar)o(ge)g(scale)g
(problems.)26 b(At)14 b(last,)i(a)f(GUI)g(is)g(also)f(a)o(v)o(ailable)h
(in)-98 699 y(the)f(LMI)g(Control)f(T)l(oolbox)f([13],)j(b)o(ut)e(it)g
(is)g(less)h(con)n(vi)o(vial)e(than)h(the)g(two)g(former)i(tools)d(and)
h(similar)h(lo)o(w)f(speed)-98 755 y(complications)d(are)i(noticed.)-98
847 y(W)l(e)k(therefore)f(chose)f(not)g(to)g(de)o(v)o(elop)g(such)g(a)h
(GUI)g(tool.)24 b(First,)15 b(we)g(belie)o(v)o(e)g(such)f(tools)f(are)i
(necessarily)f(quite)-98 903 y(slo)o(w)m(.)g(The)c(second)h(reason)g
(is)f(that)h(we)g(do)g(not)f(ha)o(v)o(e)h(the)g(required)g(programming)
g(skills.)h(The)f(chosen)f(frame)o(work)-98 960 y(is)k(an)h(in-line)f
(declaration)f(of)i(the)f(LMC)i(problems)e(as)g(in)h(the)f(LMI)h
(Control)f(T)l(oolbox)f([13].)25 b(The)14 b(result)g(is)g(less)-98
1016 y(con)n(vi)o(vial)f(than)h(a)g(GUI)g(b)o(ut)g(allo)o(ws)f(more)h
(\003e)o(xibility)m(.)22 b(Ne)o(v)o(ertheless,)15 b(ef)o(forts)e(were)i
(made)g(on)f(nice)g(display)e(and)-98 1073 y(some)g(complications)d(we)
i(noticed)g(in)f(the)h(LMI)h(Control)e(T)l(oolbox)g(do)h(not)f(occur)i
(in)f(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)16 b FA(I)r
Fz(N)r(T)r(E)r(R)r(FA)q(C)r(E)q FA(.)-98 1165 y(Note)h(that)g(more)h
(recently)m(,)h(almost)e(at)g(the)g(same)h(time)g(as)g(S)r
Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)k FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)r(C)
r(E)g FA(1.01)17 b(was)g(achie)o(v)o(ed,)i(ha)o(v)o(e)-98
1221 y(appeared)12 b(two)f(other)g(tools)g([24)o(,)i(19)o(].)j(The)o(y)
c(adopt)f(a)h(quite)f(close)g(approach)h(b)o(ut)f(focus)g(on)h(of)o
(fering)f(the)h(interface)-98 1278 y(with)h(multiple)e(solv)o(ers.)20
b(LMIlab)13 b(T)n(ranslator)g([24)o(],)i(proposes)d(a)h(translator)f
(that)h(allo)o(ws)f(to)h(call)g(v)o(arious)f(solv)o(ers,)-98
1334 y(among)f(which)h(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r
Fz(I)q FA(,)i(using)c(the)h(interface)g(of)g(the)g(LMI)g(Control)g(T)l
(oolbox.)h(Y)-5 b(ALMIP)12 b([19)o(],)g(is)f(a)g(completely)-98
1391 y(ne)o(w)i(interface)g(more)h(alike)f(LMIT)o(OOL)g([9])g(b)o(ut)g
(without)e(the)i(GUI.)h(Ha)o(ving)e(focused)h(on)g(translation)f(these)
g(two)-98 1447 y(tools)g(are)i(highly)d(v)o(aluable)h(to)g(test)h(the)f
(ef)o(\002cienc)o(y)i(of)f(solv)o(ers)f(on)h(dif)o(ferent)f(hard)h
(problems.)19 b(The)13 b(by-product)f(is)-98 1503 y(that)f(the)o(y)g
(do)g(not)f(e)o(xploit)g(all)h(the)g(potentialities)d(of)j(each)h(solv)
o(er)n(.)-98 1663 y Fn(1.5)50 b(Functionalities)-98 1786
y FA(The)11 b(functionalities)e(of)j(S)r Fz(E)r FA(D)r
Fz(U)r FA(M)r Fz(I)k FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)r(C)r(E)g
FA(are)11 b(the)g(follo)o(wing:)-29 1915 y Fp(\017)22
b FA(Declare)12 b(an)f(LMC)h(problem.)16 1971 y(Fi)o(v)o(e)19
b(M)r Fz(A)n(T)r(L)r(A)r(B)i FA(functions)16 b(allo)o(w)h(to)g
(de\002ne)g(completely)g(an)h(LMC)g(problem)f(characterised)g(by)g
(matrix)16 2028 y(v)o(ariables,)10 b(linear)f(matrix)h(equalities)e
(\(LMEs\),)i(linear)g(matrix)g(inequalities)d(\(LMIs\))j(and)g(a)g
(linear)g(objecti)o(v)o(e:)71 2122 y FB(\226)22 b FA(Initialise)9
b(the)i(LMC)h(problem:)h Fx(sdmpb)p FA(.)71 2195 y FB(\226)22
b FA(Declare)12 b(the)f(matrix)g(v)o(ariables:)h Fx(sdmvar)p
FA(.)71 2268 y FB(\226)22 b FA(Declare)12 b(the)f(block)f(partitioned)f
(equality)h(constraints:)i Fx(sdmlme)g FA(and)f Fx(sdmequ)p
FA(.)71 2341 y FB(\226)22 b FA(Declare)12 b(the)f(block)f(partitioned)f
(inequality)g(constraints:)j Fx(sdmlmi)h FA(and)e Fx(sdminequ)p
FA(.)71 2413 y FB(\226)22 b FA(Declare)12 b(the)f(linear)f(objecti)o(v)
o(e:)j Fx(sdmobj)p FA(.)-29 2507 y Fp(\017)22 b FA(Solv)o(e)11
b(an)g(LMC)h(problem.)16 2564 y(A)e(unique)e(function,)h
Fx(sdmsol)p FA(,)j(calls)d(the)h(S)r Fz(E)r FA(D)r Fz(U)r
FA(M)r Fz(I)j FA(solv)o(er)n(.)g(Options)8 b(allo)o(w)h(to)g(tune)g
(the)g(solv)o(er)g(parameters.)-29 2657 y Fp(\017)22
b FA(Modify)11 b(an)g(LMC)h(problem.)16 2714 y(At)d(an)o(y)h(moment)g
(it)f(is)g(possible)f(to)h(append)h(an)f(LMC)i(problem)e(by)g(adding)g
(v)o(ariables,)g(inequalities)f(or)i(linear)16 2770 y(terms)f(to)g(the)
f(objecti)o(v)o(e.)13 b(Moreo)o(v)o(er)n(,)e(the)d Fx(sdmset)i
FA(function)e(allo)o(ws)g(to)g(freeze)i(matrix)f(v)o(ariables)f(to)h
(speci\002ed)16 2827 y(v)o(alues.)836 2951 y(5)p eop
%%Page: 6 7
6 6 bop 170 -80 a Fp(\017)22 b FA(Analyse)11 b(the)f(solution)f(issued)
h(from)i(the)f(solv)o(er)n(.)215 -24 y(F)o(or)h(all)e(\(feasible)g(or)h
(not\))f(problems,)h(the)f(solv)o(er)g(outputs)f(the)h(last)g(computed)
h(iterate)f(\()p Fx(sdmget)p FA(\).)17 b(S)r Fz(E)r FA(D)r
Fz(U)r FA(M)r Fz(I)216 33 y FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)r(C)r(E)g
FA(allo)o(ws)11 b(to)h(analyse)f(this)g(result)h(in)g(a)g(con)n(vi)o
(vial)f(display)m(.)16 b(The)c(solution)e(is)i(displayed)f(directly)215
89 y(in)g(matrix)g(format)h(and)f(indicators)e(sho)o(w)h(which)h
(constraints)e(are)j(satis\002ed.)102 260 y Fn(1.6)50
b(Installing)12 b FM(S)r Fh(E)r FM(D)r Fh(U)r FM(M)r
Fh(I)18 b FM(I)r Fh(N)r(T)r(E)r(R)r(F)o(AC)r(E)103 385
y FA(S)r Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)13 b FA(I)r
Fz(N)r(T)r(E)r(R)r(F)o(A)q(C)s(E)g FA(is)8 b(composed)g(of)g(simple)h
(M)r Fz(A)n(T)r(L)r(A)r(B)k FA(\002les)8 b(\()p Fx(sdm***.m)p
FA(\))i(gathered)e(in)g(a)h(directory)m(,)g Fx(SeDuMiInt104)p
FA(,)102 441 y(and)i(a)g(subdirectory)m(,)f Fx(@sdmpb)p
FA(.)16 b(The)11 b(\002rst)g(directory)f(contains:)170
577 y Fp(\017)22 b Fx(sdmguide.ps)14 b FA(:)f(this)d(report.)170
680 y Fp(\017)22 b Fx(COPYING)13 b FA(:)e(the)g(GNU)g(general)g(public)
f(licence.)170 782 y Fp(\017)22 b Fx(Contents.m)13 b
FA(:)h(the)d(help)g(\002le)g(for)i(S)r Fz(E)r FA(D)r
Fz(U)r FA(M)r Fz(I)j FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)q(C)r(E)r
FA(.)170 885 y Fp(\017)22 b Fx(sdmdemo.m)13 b FA(:)h(the)d
(demonstration)f(M)r Fz(A)n(T)r(L)r(A)r(B)16 b FA(\002le.)170
988 y Fp(\017)22 b Fx(sdmupq.m,)j(sdmvec.m,)g(sdmmat.m,)g(sdmrank,)f
(sdmclear)15 b FA(:)h(\002)o(v)o(e)d(\002les)g(called)f(by)g(some)h(of)
g(the)g(S)r Fz(E)r FA(-)216 1044 y(D)r Fz(U)r FA(M)r
Fz(I)i FA(I)r Fz(N)r(T)r(E)r(R)r(F)o(A)r(C)r(E)h FA(operators.)102
1180 y(The)11 b(subdirectory)m(,)f Fx(@sdmpb)p FA(,)i(contains)e(the)h
(14)g(essential)f(operators)g(for)i(LMC)g(problem)f(declaration.)102
1272 y(The)k(interface)f(works)g(with)i(M)r Fz(A)n(T)r(L)r(A)r(B)j
FA(v)o(ersion)14 b(5.3)i(or)f(more)g(and)g(with)h(S)r
Fz(E)r FA(D)r Fz(U)r FA(M)r Fz(I)i FA(v)o(ersion)d(1.05.)26
b(W)l(e)16 b(assume)102 1328 y(that)11 b(one)g(of)h(these)f(two)g(v)o
(ersions)f(of)i(the)f(software)g(is)h(installed)d(on)j(your)f(computer)
n(.)