期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一些修正的线搜索及其收敛性 被引量：2

Some Modified Step-size Rules and the Convergence Properties
下载PDF
导出
摘要 文献中,韦(Wei Z.)用k次迭代的矩阵函数f+(x-xk)TAk(x-xk)来代替简单函数f(f是给定问题的目标函数),Ak为给定的对称正定矩阵,并给出了一些新的线性搜索.该文在详细叙述新准则的基础上进一步讨论了给定算法在这些线搜索下的下降性质及收敛性.并且证明了当Ak满足文中所给条件时算法具有超线性收敛速度. Wei[ 16 ] has given some modified line searches. Inthis paper, we discuss the descent properties and the convergence properties of these line searches. Furthermore, some conditions which can ensure the argorithms with the modified line searches that converge superlineraly are given.
作者 陆春桃
机构地区 广西电力职业技术学院
出处 《广西师范学院学报（自然科学版）》 2006年第2期13-19,共7页 Journal of Guangxi Teachers Education University(Natural Science Edition)
关键词 非线性规划 非精确搜索 全局收敛性 收敛速度 nonlinear optimization inexact line search global convergence gradient related
分类号 O22 [理学—运筹学与控制论]
  • 相关文献

参考文献1

二级参考文献5

  • 1Miele A, Cantrell J W. Study on a memory gradient method for the minimization of functions[J]. Journalof Optimization Theory and Applications, 1969, 3(6):459-470.
  • 2Cantrell J W. Relation between the memory gradient method and the Fletcher-Revees method[J]. Journal of Optimization Theory and Applications, 1969, 4(1):67-71.
  • 3Cragg E E, Levy A V. Study on a supermemory gradient method for the minimization of functions [J].Journal of Optimization Theory and Applications,1969, 4(3):191-205.
  • 4Wolfe M A, Viazminsky C. Supermemory descent methods for unconstrained minimization[J]. Journal of Optimization Theory and Applications, 1976, 18(4) :455 - 468.
  • 5时贞军.无约束优化的超记忆梯度算法[J].工程数学学报,2000,17(2):99-104. 被引量：45

共引文献3

同被引文献22

  • 1韦增欣,武小平,刘利英.广义Wolfe线搜索下共轭梯度法的全局收敛性[J].广西科学,2005,12(3):167-169. 被引量：2
  • 2吴庆军,韦增欣.Some new step-size rules for optimization problems[J].Journal of Shanghai University(English Edition),2007,11(2):135-141. 被引量：4
  • 3LOBO M S,VANDENBERGHE L,BOYD S,et al. Application of second order cone programming[J]. Linear Algebra and Its Applications, 1998,284 (1) : 193-228.
  • 4BENSON H Y,VANDERBEI R J. Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming[J]. Math Program :Series B, 2003,95 (2) : 279-302.
  • 5LEBRET H,BOYD S. Antenna array pattern synthesis via convex optimization[J]. IEEE Transactions on Signal Pro- cessing, 1997.45 (3) : 526-532.
  • 6LU Wu-sheng,HINAMOTO T. Optimal design of IIR digital filters with robust stability using conic-quadratic-pro- gramming updates[J]. IEEE Transactions on Signal Processing, 2003,51 (6) : 1581-1592.
  • 7MURAMATSU M,SUZUKI T. A new second-order cone programming relaxation for Max-cut problems[J]. Journal of the Operations Research Society of Japan, 2003,46(2) : 164-177.
  • 8LUO Zhi-quan. Applications of convex optimization in signal processing and digital communication[J]. Math Pro- gram:Series B,2003,97(1/2) : 177-207.
  • 9RIKA I,FUJIE T,SUYAMA K,et al. Design methods of FIR filters with signed power of two coefficients using a new linear programming relaxation with triangle inequalities[J]. International Journal of Innovative Computing,In- formation and Control, 2006,2 (1) : 441-448.
  • 10MONTEIRO R D C,TAKASHI T. Polynomial convergence of primal-dual algorithms for the second-order cone pro-gram based on the MZ-family of directions [J]. Math Program : Series B, 2000,88 (1) : 61-83.

引证文献2

广西师范学院学报（自然科学版）
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部