“优化与应用”2010前沿讲座

《“优化与应用”2010前沿讲座》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、“优化与应用”前沿讲座时间：2010.7.31-8.1地点：思源楼一层大报告厅主办：数学院“优化与应用”研究中心7月31日下午学术报告（2：00开始）报告题目：AnAnalysisofSerialAllocationRuleinGroupBuying报告者：JiaweiZhang（张家伟）报告者单位：NewYorkUniversityAbstract:Whenaselleroffersquantitydiscount,buyerscanaggregatetheirpurchasingquantitytoobtain

2、lowerprices.Acostallocationruledetermineshowmucheachbuyerwouldpayfortheamounttheytheypurchased.Variouscostallocationruleshavebeenusedinpractice.Differentallocationrulesmayhavemaydifferentinfluenceonthebuyers'behavior(i.e.,theirpurchasingquantities)Inthispaper,

3、westudytheserialallocationruleandanalyzetheequilibriumpurchasingquantityunderthisrule.报告题目：Approximationalgorithmsforthefacilitylocationproblemswithlinear/submodularpenalties报告者：徐大川报告者单位：北京工业大学Abstract:Westudytwovariantsoftheclassicalemph{facilitylocationprob

4、lem}(FLP),namelytheemph{facilitylocationproblemwithlinearpenalties}(FLPLP)andtheemph{facilitylocationproblemwithsubmodularpenalties}(FLPSP).Ourmaincontributionistoprovidegreatlyimprovedapproximationalgorithmsforbothproblemsviaseveralnoveltechniqueswhichexplo

5、itthespecialpropertiesofthelinear/submodularpenaltyfunction.Fortheformerproblem,ourLP-roundingbasednon-combinatorial$1.575$-approximationalgorithmoffersthecurrentlybestapproximationratio(thecurrentlybestcombinatorialapproximationratiois$1.853$duetoXuandXucite

6、{xx2}).Forthelatterproblem,ourLP-roundingbased$2.056$-approximationalgorithmandtheprimal-dualwithgreedyargumentationbased$2.375$-approximationalgorithmofferthecurrentlybestnon-combinatorialandcombinatorialapproximationratios,respectively.Moreover,wealsogivethe

7、firstverifiabledual-fittingbasedapproximationalgorithmsforbothproblems.JointworkwithYuLi,DongleiDu,andNaihuaXiu.4报告题目：SparseSignalReconstructionviaIterativeSupportDetection报告者：WotaoYin（印卧涛）报告者单位：RiceUniversityAbstract:Wepresentanovelsparsesignalreconstructionm

8、ethod“ISD”,whichreconstructssparsesignalsfasterfromareducednumberofmeasurementscomparedtotheclassicalL1minimization.ISDaddressesfailedreconstructionsofL1minimizationduetoinsufficie