期刊文献+

简单界约束非线性方程组的不精确线搜索法 被引量:1

Nonmonotone Line Search Method for Nonlinear Equations with Simple Bounds
下载PDF
导出
摘要 提出一种用非单调线搜索方法求解简单界约束非线性方程组,算法采用满足Armijo条件的不精确线搜索技巧,并使用非单调结构,将当前函数最大值的下降改进为函数平均值的下降,推广了算法的适用范围.最后进行了数值试验,结果表明,算法十分有效. In this paper we present a nonmonotone line search method for solving nonlinear equations with simple bounds. The new method uses inaccuracy line search technique which satisfies Armijo conditions, and uses normaotone structure which relaxes the conditions that the trial step is accepted. The "max" of function values is replaced by an average of function values. The new method is more concise and more general. Under the standard assumptions, the global convergence for the algorithm is proven. Finally, the numerical test report is given which shows the new method is very effective.
作者 夏红卫
出处 《沈阳师范大学学报(自然科学版)》 CAS 2007年第4期425-428,共4页 Journal of Shenyang Normal University:Natural Science Edition
关键词 非线性方程组 Armijo条件 非单调 线搜索 nonlinear equations annijo conditions nonmonotone line search
  • 相关文献

参考文献6

  • 1FRANSICO J B, KREJIC N, MARTINEZ J M. An interior-point method for solving box-constrained underdetermined nonliear systems[J ]. J Comp Appl Math, 2005,177( 1 ) : 67-88.
  • 2BELLAVIA S, MACCONI M, MORINI B. An affine scaling trust-region approach to bound-constrained nonlinear systems[J]. Appl Nummer Math, 2003,44(3) :257-280.
  • 3FAN J, YUAN X. On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption [J]. Computing, 2005,74(1) :23-39.
  • 4郭楠.凸约束非线性方程组的非单调投影L-M方法[J].苏州大学学报(自然科学版),2006,22(1):10-14. 被引量:6
  • 5刘静,王平,陈中文.简单界约束优化的仿射尺度内点信赖域算法的收敛性[J].应用数学学报,2005,28(1):114-123. 被引量:3
  • 6BONGARTZ I, CONN A R, GOULD N I M, et al. Constrained and unconstrained testing environments[J]. Math Software, 1995,21 : 123-160.

二级参考文献9

  • 1Coleman T F, Li Y. An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds.SIAM J. Optim., 1996, 6:418-445.
  • 2Conn A R, Gould N I M, Toint Ph L. Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables. Math Comp., 1988, 50:399-430.
  • 3Yin H, Han J. A New Interior Point Trust Region Algorithm for Nonlinear Minimization Problems with Simple Bound Constraints. Presentation at the International Conference on Nonlinear Programming and Variational Inequalities, Hong Kong, 1998.
  • 4Lescrenier M. Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity does not Hold. SIAM J. Numer. Anal., 1991, 28:476-495.
  • 5Lin C. Moré J J. Newton's Method for Large Bound-constrained Optimization Problems. SIAM J.Optim., 1999, 9:1100-1127.
  • 6Heinkenschloss M, Ulbrich M, Ulbrich S. Superlinear and Quadratic Convergence of Affine-scaling Interior-point Newton Methods for Problems with Simple Bounds without Strict Complementarity Assumption. Math. Prog., (Series A), 1999, 86:615-635.
  • 7FRANSINCO J B, KREJIC N, MARTINEZ J M. An interio-point method for solving boxconstrained underdetermined nonliear systems[J]. Joural of Computational and Applied Mathematics, 2005,177: 65 - 88.
  • 8CALAMAI P H, MORE J J. Projected gradient methods for linearly constrained problems[J]. Math Prog, 1987,39:93- 116.
  • 9CHRISTIAN K, NOBUO Y, MASAO F. Levenberg-Marquardt Methods for Constrained Nonlinear Equations with Strong Local Convergence Properties[R]. Technical Report, 2002.

共引文献5

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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