基于近端算法的DC规划解球面约束下四次型极小化问题  

A Proximal DC Algorithm for Quartic Minimization Over the Sphere

作　　者：舒杭 王洁 SHU Hang;WANG Jie(School of Sciences,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China;School of Sciences,China Jiliang University,Hangzhou Zhejiang 310018,China)

机构地区：[1]杭州电子科技大学理学院,浙江杭州310018 [2]中国计量大学理学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2024年第1期97-102,共6页Journal of Hangzhou Dianzi University：Natural Sciences

摘　　要：对于球面约束下的四次型极小化问题,可使用DC(difference of convex)规划来求解。现基于近端算法对DC算法进行了一些改进,提出pDCA和aDCA两种算法,并证明了算法局部收敛以及收敛速度至少达到了次线性收敛。数值实验结果表明,与一般的DC算法和对称移位高阶幂法相比,在计算时间和解的最优性方面都得到了很大提升。DC programming is one of the methods for quartic minimization over the sphere.In this paper,a method for quartic minimization over the sphere is DC programming.We This paper proposes two algorithms,i.e.,pDCA and aDCA,to improve the DC algorithm based on the proximal algorithm.and propose two algorithms,pDCA and aDCA.We It also proves that the local convergence,where the convergence speed of the algorithm reaches at least sublinear convergence.Numerical experimental results show that compared with both the general DC algorithm and the HOPM,pDCA and aDCA require less time and the optimality of the calculation solution has been improved.

关 键 词：四次型 DC算法 四阶对称张量 近端算法 

分 类 号：O221.2[理学—运筹学与控制论]