Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
!"$#%&"')(10 2 35476 8 94A@ B C 3ED5F GIH PRQSQUTWVX
 

Summary:  !"$#%&"')(10
2 35476 8 94A@ B C 3ED5F GIH PRQSQUTWVX
Y `!acbedfd gih pqgratsvuwgyx $bvagvax $ by$
gvx gedd$gyu Y afeggvdihx dRhjgv kwlgmhnbedo$
kpx qrsSudt pugevbvx x iuve
w xzy{xzy}|~l %oioUoi!f
ou
cc f1dtt %l1t%tttczt i©%õĶtȥʬtt
dIJdttƬtЬttʤԬctttЬȥ۩%tl%lޡӻc۱֪äl$iޣޡcti
A Class of Polynomial Volumetric Barrier
Decomposition Algorithms for Stochastic Semidefinite
Programming
K. A. Ariyawansa
and Yuntao Zhu
Abstract
Ariyawansa and Zhu [5] have recently proposed a new class of optimization problems termed
stochastic semidefinite programs (SSDP's). SSDP's may be viewed as an extension of two-stage
stochastic (linear) programs with recourse (SLP's). Zhao [25] has derived a decomposition algo-
rithm for SLP's based on a logarithmic barrier and proved its polynomial complexity. Mehrotra
and Ozevin [17] have extended the work of Zhao [25] to the case of SSDP's to derive a polyno-

  

Source: Ariyawansa, Ari - Department of Mathematics, Washington State University

 

Collections: Mathematics