简介:BasedonthesemidefiniteprogrammingrelaxationoftheCDMAmaximumlikelihoodmultiuserdetectionproblem,adetectionstrategybythesuccessivequadraticprogrammingalgorithmispresented.Coupledwiththerandomizedcutgenerationscheme,thesuboptimalsolutionofthemultiuserdetectionprobleminobtained.Comparedtotheinteriorpointmethodspreviouslyreportedbasedonsemidefiniteprogramming,simulationsdemonstratethatthesuccessivequadraticprogrammingalgorithmoftenyieldsthesimilarBERperformancesofthemultiuserdetectionproblem.ButtheaverageCPUtimeofthisapproachissignificantlyreduced.
简介:Inordertoslovethelarge-scalenonlinearprogramming(NLP)problemsefficiently,anefficientoptimizationalgorithmbasedonreducedsequentialquadraticprogramming(rSQP)andautomaticdifferentiation(AD)ispresentedinthispaper.Withthecharacteristicsofsparseness,relativelylowdegreesoffreedomandequalityconstraintsutilized,thenonlinearprogrammingproblemissolvedbyimprovedrSQPsolver.Inthesolvingprocess,ADtechnologyisusedtoobtainaccurategradientinformation.Thenumericalresultsshowthatthecombinedalgorithm,whichissuitableforlarge-scaleprocessoptimizationproblems,cancalculatemoreefficientlythanrSQPitself.
简介:Thepaperpresentsaneuralnetworkforsolvingaclassofquadraticprogrammingproblems.Theneuralnetworkiscompletelystabletoexactsolutionsandtherearenoparameterstoset.Moreover,noanaloguemultipliersanddividersarerequired,incontrasttoexistingneuralnetwork[3]whichneedsplentyofanaloguemultipliers.