学科分类
/ 1
1 个结果
  • 简介:Inthispaperweinvestigateseveralsolutionalgorithmsfortheconvexfea-sibilityproblem(CFP)andthebestapproximationproblem(BAP)respectively.Thealgorithmsanalyzedarealreadyknownbefore,butbyadequatelyreformulatingtheCFPortheBAPwenaturallydeducethegeneralprojectionmethodfortheCFPfromwell-knownsteepestdecentmethodforunconstrainedoptimizationandwealsogiveanaturalstrategyofupdatingweightparameters.Inthelinearcaseweshowtheconnec-tionofthetwoprojectionalgorithmsfortheCFPandtheBAPrespectively.Inaddition,weestablishtheconvergenceofamethodfortheBAPundermilderassumptionsinthelinearcase.WealsoshowbyexamplesaBauschke'sconjectureisonlypartiallycorrect.

  • 标签: 可行性问题 近似值 投射方法 收敛函数