位置：成果数据库 > 期刊 > 期刊详情页
一种新的带扰动项的算法的全局收敛性
  • ISSN号：1001-9847
  • 期刊名称：《应用数学》
  • 时间：0
  • 分类：O221.1[理学—运筹学与控制论;理学—数学]
  • 作者机构：[1]潍坊学院数学系,山东潍坊261061
  • 相关基金：Supported by the National Natural Science Foundation of China （10571106）
作者： 李梅霞[1], 籍法俊[1]
关键词： 三项记忆梯度混合投影算法, 扰动, 全局收敛性, Three-term memory gradient hybrid projection method, Perturbation, Global convergence
中文摘要：

在本文中，我们提出了一种新的带扰动项的三项记忆梯度混合投影算法．在这种方法中应用了广义Armijo线搜索，并且仅在梯度函数在包含迭代序列的开凸集上一致连续的条件下证明了该算法的全局收敛性．最后给出了几个数值算例，

英文摘要：

A new kind of method which is called three-term memory gradient hybrid projection method with perturbations is proposed. And the generalized Armijo line search is used in this method. At the same time.global convergence property of the method is proved only in the case where the gradient function is uniformly continuous on an open convex set containing the iteration sequence. Numerical examples are given at the end of this paper

同期刊论文项目
广义半无限规划的理论与算法研究
期刊论文 80
同项目期刊论文
带扰动项的梯度法与混合投影法的收敛性分析
Dai-Yuan Conjugate Gradient Method with Linesearch in the presence of Error
Unified theory of augumented Lagrangian methods for constrained global optimization
求解拟变分不等式问题的一种投影算法
A Trust region algorithm with memory for equality constrained optimization
Global Convergence of the Dai-Yuan conjugate gradient method with perturbations
Convergence property of gradient-type methods with non-monotone line search in the presence of pertu
Solving semidefinite programming problems via alternating direction methods
Global convergence of modified HS conjugate gradient method
A new halfspace-relaxation projection method for the split feasibility problem
Convergence properties of the dependent PRP conjugate gradient methods
A Trust Region Method for Optimizxation problem with Singular Solutions
带扰动项的梯度法与混合投影法的收敛性分析,
Merit Function and Error Bound via SQP Method and their Applications
约束最优化问题中投影梯度的误差界及其应用
带扰动项的FR共轭梯度法
On the convergence of a new hybrid projection algorithm
A Class of Conjugate gradient methods with Armijo-type line searches
Convergence property of the three-term memory gradient method and its projection method
A method for solving nonlinear complementarity problems and its convergence properties
Convergence Properties of a Correlative Polak- Ribiere Conjugate Gradient Method
解带线性或非线性约束最优化问题的混合三项记忆梯度投影算法
一个新的带误差项的记忆梯度算法
A new nonmonotone line search technique for unconstrained optimizati optimization
Strong Global Convergence of an Adaptive Nonmonotone Memory Gradient Method
Convergence properties of inexact projected gradient methods
Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
A Note On The Gradient Projection Method With Exact Stepsize Rule
Global convergence of a memory gradient method without line search
A Global Error Bound via the SQP Method for constrained Optimization Problem and Its Applications
Convergence properties of descent methods with errors
求解非线性系统的有效集信赖域方法
Global convergence of a modified gradient projection method for convex constrained problems
新非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法
大步长非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法的全局收敛性
Some projection-like Methods for the Generalized Nash Equilibria
Solving?a?class?of?generalized?semi-infinite? programming?via?augumented lagrangians
指数型增广Lagrangian函数在广义半无限规划中的应用
通过转化来求解广义半无限极大极小问题
On Saddle Points of a Alass of Augumented Lagrangian Functions
A smoothing Levenberg–Marquardt method for the extended linear complementarity problem
一类逼近精确罚函数的罚函数
Zero Duality Gap Properties for a Class of Lagrangian Dual Problem and the Convergence of its Optima
Saddle Points Theory of Two Classes of Augumented Lagrangians and Its Applications to Generalized Se
New Differential properties of sup-type funvtions
A relaxed extragradient-like method for a class of constrained optimization problem
Value Functions and Error Bounds of Trust Region Methods
Further insight into the Shamanskii modification of Newton method
A Global Error Bound of constrained Optimization Problem and Its Applications
Two Error Bounds for Constrained Optimization Problems and Their Applications
Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
A hybrid method for the generalized Nash equilibria
On smoothing exact penalty functions for nonlinear constrained optimization problems
A Nonsmooth Levenberg-Marquardt Method for Solving Semi-Infinite Programming Problems
New Optimality Conditions for Generalized Semi-Infinite Min-Max Programming
A note on finite termination of iterative algorithms in mathematical programming
一类广义半无限规划问题的光滑牛顿算法
Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-conve
First-order Optimality Conditions for Convex Semi-infinite Min-Max Programming with Noncompact Sets
Properties of saddle points for generalized augumented Lagrangian
Unified Nonlinear Lagrangian Approach to Duality and Optimal Paths
结合广义Armijo步长搜索的带误差项的记忆梯度算法
修正的HS共轭梯度算法的全局收敛性
Global Convergence of a New Restarting Three Terms Conjugate Gradient Method for Non-linear Optimizations
线搜索下带误差项的Dai—Yuan共轭梯度算法
带误差项的下降算法的收敛性
约束最优化问题中一个全局误差界及其应用
约束最优化问题中投影梯度的全局误差界及其应用
三项记忆梯度法及其投影算法的收敛性分析
一类Lagrangian对偶问题的零对偶间隙性质及其最优路径的收敛性
通过转化来求解广义半无限极大极小规划问题
广义半无限极大极小规划的一个新的最优性条件
一类新的自适应非单调谱投影梯度法
在Armijo型线搜索下共轭梯度法簇的全局收敛性
精确步长搜索下的梯度投影算法的收敛性与有限终止性
解决非线性互补问题非光滑牛顿算法的全局收敛以及局部收敛性分析
期刊信息
  • 《应用数学》
  • 北大核心期刊（2011版）
  • 主管单位:国家教育部
  • 主办单位:华中科技大学
  • 主编：李大潜
  • 地址：武汉珞喻路1037号华中科技大学逸夫科技大楼南楼902室
  • 邮编：430074
  • 邮箱：yysx_hust@163.com
  • 电话：027-87543831
  • 国际标准刊号：ISSN：1001-9847
  • 国内统一刊号：ISSN：42-1184/O1
  • 邮发代号:38-61
  • 获奖情况:
  • 中国科学引文数据库来源期刊,中国学术期刊综合评价数据库来源期刊
  • 国内外数据库收录:
  • 美国数学评论（网络版）,德国数学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,中国北大核心期刊（2000版）
  • 被引量:4139