检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《运筹学学报》2017年第2期84-100,共17页Operations Research Transactions
基 金:国家自然科学基金(No.11371273)
摘 要:针对非线性不等式约束半定规划问题提出一种新的逐次线性化方法,新算法既不要求罚函数单调下降,也不使用过滤技巧,尝试步的接受准则仅仅依赖于目标函数和约束违反度,罚函数中对应于成功迭代点的罚因子不需要单调增加.新算法或者要求违反约束度量有足够改善,或者在约束违反度的一个合理范围内要求目标函数值充分下降,在通常假设条件下,分析了新算法的适定性及全局收敛性.最后,给出了非线性半定规划问题的数值试验结果,结果表明了新算法的有效性.A successive linearization method with flexible penalty is presented to solve a nonlinear semideflnite programming with nonlinear inequality constraints. The new method does not require the penalty function to be reduced and does not use filter technique. The storage of the filter set is avoided. The updating of the penalty parameter is flexible, which is only dependent on the message of the current iterate. The penalty parameter sequence corresponding to the successful iterate point does not need to increase monotonically. To decide whether the trial step can be accepted or not, the new method requires the measure of constraint violation to be improved or the value of the objective function to be improved within the measure of feasibility control. Under the usual assumptions, we prove that the algorithm is well defined and globally convergent. Finally, preliminary numerical results are reported.
关 键 词:非线性半定规划 逐次线性化 柔性惩罚 全局收敛性
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.221.70.17