欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
本文提出了一种解凸可行问题的次梯度算法，此算法运用一种特殊的方法控制松弛参数的选取，从而使算法相对于传统的正交投影算法更简单易行，数值实验表明算法的可行性，最后基于这种次梯度投影算法，又进一步给出求解凸可行问题的共轭次梯度投影算法．
英文摘要：
In this paper, we present a subgradient algorithm without calculating the orthog- onal projections for a convex feasibility problem （CFP）. The algorithm employs a strategy for controlling relaxation parameters in a specific manner, which makes it easier to implement than the classical orthogonal projection algorithms. The convergence of the algorithm is presented own under some mild conditions. Two numerical examples are given subgradient algorithm for the subgradient algorithm. to illustrate its feasibility. convex feasibility problem Furthermore, a conjugate is proposed based on the
同期刊论文项目
同项目期刊论文
A Hermitian least squares solution of the matrix equation AXB = C subject to inequality restrictions
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility pr
Speed Optimization Control for Wheeled Robot Navigation with Obstacle Avoidance Based on Viability T
On the Convergence of Central Path and GeneralizedProximal Point Method for Symmetric Cone Linear Pr
On the Convergence of Central Path and Generalized Proximal Point Method for Symmetric Cone Linear P
Convergence of an algorithm for the split common fixed-point of asymptomatic quasi-nonexpansive oper
Portfolio selection problem with Value-at-Risk constraints under non-extensive statistical mechanics
Local composite quantile regression estimation of time-varying parameter vector for multidimensional
Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem
期刊信息
位置：