检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]沈阳航空航天大学理学院,辽宁 沈阳
出 处:《应用数学进展》2023年第10期4529-4537,共9页Advances in Applied Mathematics
摘 要:针对具有等式约束的随机优化问题,本文首先考虑基于SAA方法获取原始问题目标函数的SAA问题,并利用惩罚函数法将其转化为一般无约束凸优化问题。接下来建立二阶微分方程算法对所得到的问题进行求解。本文还证明了当算法的参数满足一定条件时,二阶微分方程算法具有良好的收敛性,其收敛率为,最后给出具体的数值算例验证算法的可行性。For the stochastic optimization problem with equality constraint, this paper first considers the SAA problem of obtaining the objective function of the original problem based on the SAA method, and uses the penalty function method to transform it into a general unconstrained convex optimization problem. Next, a second-order differential equation algorithm is established to solve the obtained problem. This paper also proves that when the parameters of the algorithm meet certain conditions, the second-order differential equation algorithm has good convergence, and its convergence rate is , and finally a specific numerical example is given to verify the feasibility of the algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.65