Iterative Algorithm for Solving Triple-Hierarchical Constrained Optimization Problem
Iterative Algorithm for Solving Triple-Hierarchical Constrained Optimization Problem
复制标题
DOI：
10.1007/s10957-010-9769-z
复制
发表时间：
2011-03
影响因子：
1.9
通讯作者：
H. Iiduka
中科院分区：
文献类型：
--
作者：
H. Iiduka
许多实际问题，如信号处理和网络资源分配，都被描述为非扩张映射不动点集上的单调变分不等式，并提出了求解这些问题的迭代算法。讨论了非扩张映象不动点集上的一个带变分不等式约束的单调变分不等式，称为三重族约束优化问题，并给出了一个求解该问题的迭代算法。在一定的假设条件下，算法强收敛于问题的唯一解。
Many practical problems such as signal processing and network resource allocation are formulated as the monotone variational inequality over the fixed point set of a nonexpansive mapping, and iterative algorithms to solve these problems have been proposed. This paper discusses a monotone variational inequality with variational inequality constraint over the fixed point set of a nonexpansive mapping, which is called the triple-hierarchical constrained optimization problem, and presents an iterative algorithm for solving it. Strong convergence of the algorithm to the unique solution of the problem is guaranteed under certain assumptions.