排序方式: 共有8条查询结果,搜索用时 15 毫秒
1
1.
In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming(GGP),we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties. 相似文献
2.
3.
4.
对凸可行问题提出了包括上松弛的平行近似次梯度投影算法和加速平行近似次梯度投影算法.与序列近似次梯度投影算法相比, 平行近似次梯度投影算法(每次迭代同时运用多个凸集的近似次梯度超平面上的投影)能够保证迭代序列收敛到离各个凸集最近的点. 上松弛的迭代技术和含有外推因子的加速技术的应用, 减少了数据存储量, 提高了收 敛速度. 最后在较弱的条件下证明了算法的收敛性, 数值实验结果验证了算法的有效性和优越性. 相似文献
5.
平行投影算法是求解凸集图像重建问题的常用工具之一,它包括迭代复杂度O (1/k)收敛性的上松弛和下松弛两种形式.本文受Nesterov加速方法的启发,首先针对凸集图像重建问题提出一种加速的下松弛并行投影算法,并在某些合适的条件下证明了其迭代复杂度O(1/k2)的收敛性.然后又提出了一种基于Arimijo技术的自适应加速... 相似文献
6.
In this paper,we present an extrapolated parallel subgradient projection method with the centering technique for the convex feasibility problem,the algorithm improves the convergence by reason of using centering techniques which reduce the oscillation of the corresponding sequence.To prove the convergence in a simply way,we transmit the parallel algorithm in the original space to a sequential one in a newly constructed product space.Thus,the convergence of the parallel algorithm is derived with the help of the sequential one under some suitable conditions.Numerical results show that the new algorithm has better convergence than the existing algorithms. 相似文献
7.
8.
交替方向乘子法(ADMM)是一种求解可分离优化问题的简单有效的方法,相关研究已经较为完善.然而,当目标函数存在耦合项时,对ADMM算法收敛性的研究还处于初期.文章针对非凸非光滑不可分离优化问题,基于对称交替方向乘子法(SADMM),结合线性化技术,提出了一种新的线性对称邻近ADMM.在一定的假设条件下,证明了算法生成的序列有界并收敛至增广拉格朗日函数的稳定点.其次,当辅助函数满足Kurdyka-Lojasiewicz性质时,证明了算法的强收敛性.最后,数值实验的结果表明了算法的有效性. 相似文献
1