摘要
Inthispaper,weinvestigateasmoothing-typealgorithmforsolvingthesymmetricconelinearprogram((SCLP)forshort)bymakinguseofanaugmentedsystemofitsoptimalityconditions.Thealgorithmonlyneedstosolveonesystemoflinearequationsandtoperformonelinesearchateachiteration.Itisprovedthatthealgorithmisgloballyconvergentwithoutassuminganypriorknowledgeoffeasibility/infeasibilityoftheproblem.Inparticular,thealgorithmmaycorrectlydetectsolvabilityof(SCLP).Furthermore,if(SCLP)hasasolution,thenthealgorithmwillgenerateasolutionof(SCLP),andiftheproblemisstronglyinfeasible,thealgorithmwillcorrectlydetectinfeasibilityof(SCLP).
出版日期
2014年03月13日(中国期刊网平台首次上网日期,不代表论文的发表时间)