吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

带一般约束无导数优化问题的改进信赖域算法

卢晓宁1, 刘红卫1, 杨善学2, 刘泽显1,3, 刘梅1   

  1. 1. 西安电子科技大学 数学与统计学院, 西安 710126; 2. 西安财经学院 统计学院, 西安 710100;3. 贺州学院 数学与计算机学院, 广西 贺州 542899
  • 收稿日期:2017-09-05 出版日期:2018-03-26 发布日期:2018-03-27
  • 通讯作者: 刘泽显 E-mail:liuzexian2008@163.com

Improved TrustRegion DerivativeFree Algorithm forGeneral Constrained Optimization Problems

LU Xiaoning1, LIU Hongwei1, YANG Shanxue2, LIU Zexian1,3, LIU Mei1   

  1. 1. School of Mathematics and Statistics, Xidian University, Xi’an 710126, China; 2. School of Statistics, Xi’an University of Finance and Economics, Xi’an 710100, China;3. School of Mathematics and Computer Science, Hezhou University, Hezhou 542899, Guangxi Zhuang Autonomous Region, China
  • Received:2017-09-05 Online:2018-03-26 Published:2018-03-27
  • Contact: LIU Zexian E-mail:liuzexian2008@163.com

摘要: 通过建立约束违和函数, 利用进步栏阈法(PB策略)筛选出插值点集中性质较好的迭代点, 同时修正子问题的初始增广Lagrange乘子, 提出一种改进的无导数信赖域(TRDF)算法, 并证明了改进算法的收敛性. 针对不同维数测试问题的数值试验结果表明, 改进算法有效降低了求解二次插值模型的迭代次数和迭代时间.

关键词: 信赖域方法, 约束违和函数, 二次插值模型, 增广Lagrange乘子

Abstract: We presented an improved trustregion derivativefree (TRDF) algorithm. In the proposed method, we established the constraint violation function, chose a better iteration point by using the progressive barrier (PB) strategy modified sub problem of the initial augmented Lagrangian multiplier, and proved the convergence of the improved algorithm. Numerical experiments for different dimensions of the test results show that the improved algorithm effectively reduces the number of iterations and the iteration time for solving polynomial interpolation model.

Key words: trust region method, polynomial interpolation model, constraint violation function, augment Lagrangian multiplier

中图分类号: 

  • O221.2