A General Iterative Method for Solving Constrained Convex Minimization Problems

被引：0
|
作者：
Ming Tian
Min-Min Li
机构：
[1] Civil Aviation University of China,College of Science
来源：
Journal of Optimization Theory and Applications | 2014年 / 162卷
关键词：
Variational inequality; Regularization algorithm; Constrained convex minimization; Fixed point; Averaged mapping; Nonexpansive mappings;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
It is well known that the gradient-projection algorithm plays an important role in solving minimization problems. In this paper, we will use the idea of regularization to establish a general method so that the sequence generated by the general method can be strongly convergent to a minimizer of constrained convex minimization problems, which solves a variational inequality under suitable conditions.
引用
收藏
页码：202 / 207
页数：5
相关论文
共 50 条
12345