数学物理学报 ›› 2023, Vol. 43 ›› Issue (4): 1284-1296.

• • 上一篇    下一篇

大规模非凸不可分优化问题的分裂序列二次规划算法

简金宝(),林惠(),马国栋*()   

  1. 广西民族大学数学与物理学院, 广西应用数学中心, 广西混杂计算与集成电路设计分析重点实验室 南宁 530006
  • 收稿日期:2022-09-20 修回日期:2023-02-20 出版日期:2023-08-26 发布日期:2023-07-03
  • 通讯作者: 马国栋 E-mail:jianjb@gxu.edu.cn;lh092561@163.com;mgd2006@163.com
  • 作者简介:简金宝, E-mail: jianjb@gxu.edu.cn;|林惠,E-mail: lh092561@163.com
  • 基金资助:
    国家自然科学基金(12261008);广西自然科学基金(2020GXNSFDA238017);广西民族大学相思湖青年学者创新团队(2022GXUNXSHQN04);广西高等学校千名中青年骨干教师培育计划资助

A Splitting Sequence Quadratic Programming Algorithm for the Large-Scale Nonconvex Nonseparable Optimization Problems

Jian Jinbao(),Lin Hui(),Ma Guodong*()   

  1. College of Mathematics and Physics, Center for Applied Mathematics of Guangxi, Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi Minzu University, Nanning 530006
  • Received:2022-09-20 Revised:2023-02-20 Online:2023-08-26 Published:2023-07-03
  • Contact: Guodong Ma E-mail:jianjb@gxu.edu.cn;lh092561@163.com;mgd2006@163.com
  • Supported by:
    NSFC(12261008);NSFGX(2020GXNSFDA238017);Xiangsihu Young Scholars Innovative Research Team of Guangxi Minzu University(2022GXUNXSHQN04);Guangxi Scholarship Fund of Guangxi Education Department

摘要:

该文研究了目标函数和约束函数带不可分结构的大规模非凸优化问题, 提出了一个新的分裂序列二次规划算法. 首先, 借助分裂算法思想将传统二次规划 (QP) 子问题的增广拉格朗日问题分解为两个小规模 QP 子问题, 通过求解小规模QP 子问题产生改进的搜索方向. 其次, 以增广拉格朗日函数作效益函数, 通过 Armijo 线搜索产生下一个迭代点. 在较为温和的条件下, 获得新算法的全局收敛性. 最后, 对该算法进行了数值实验, 验证了算法的有效性.

关键词: 非凸不可分优化, 分裂算法, 序列二次规划, 全局收敛性

Abstract:

In this paper, the large-scale nonconvex optimization problems with nonseparable structure of objective function and constraint function are discussed, a new splitting sequence quadratic programming algorithm is proposed. Firstly, the idea of splitting algorithm is embedded into solving the quadratic programming (QP) subproblem approximating the discussed problem, then the QP subproblem is split into two small-scale QPs. Secondly, by taking the augmented Lagrangian function as the merit function, the next iteration point is generated by the Armijo line search. Under the mild conditions, the global convergence of the proposed algorithm is obtained. Finally, some numerical results are reported, which preliminarily show that the proposed algorithm is promising.

Key words: Nonconvex nonseparable optimization, Splitting algorithm, Sequential quadratic programming, Global convergence

中图分类号: 

  • O221