位置：成果数据库 > 期刊 > 期刊详情页
Improved relaxed CQ methods for solving the split feasibility problem
  • 期刊名称：Advanced Modeling and Optimization
  • 时间：2011.2.2
  • 页码：305-317
  • 相关项目：带有秩约束的最小二乘半定规划问题的数值算法
作者： Min Li|
同期刊论文项目
带有秩约束的最小二乘半定规划问题的数值算法
期刊论文 11
同项目期刊论文
The PPA-based numerical algorithm with the O(1/t) convergence rate for variant variational inequalit
An LQP-based descent method for structured monotone variational inequalities
A hybrid LQP-based method for structured variational inequalities
Some proximal algorithms for linearly constrained general variational inequalities
An LQP-based decomposition method for solving a class of variational inequalities
Some Goldstein's type methods for co-coercive variant variational inequalities
Modified halfspace-relaxation projection methods for solving the split feasibility problem
On the O(1/t) convergence rate of the LQP prediction-correction method
Convergence analysis of the relaxed proximal point algorithm
Inexact alternating direction method of multipliers with logarithmic-quadratic proximal regularizati