一般约束极大极小优化问题一个强收敛的广义梯度投影算法

数学物理学报 ›› 2020, Vol. 40 ›› Issue (3): 641-649.

一般约束极大极小优化问题一个强收敛的广义梯度投影算法

马国栋()

^{玉林师范学院数学与统计学院&广西高校复杂系统优化与大数据处理重点实验室广西玉林 537000}

收稿日期:2019-03-22 出版日期:2020-06-26 发布日期:2020-07-15
作者简介:马国栋, E-mail:mgd2006@163.com
基金资助:
广西自然科学基金(2018GXNSFAA281099);国家自然科学基金(11771383);玉林师范学院科研项目(2019YJKY16);玉林师范学院科研项目(G20150010)

A Strongly Convergent Generalized Gradient Projection Method for Minimax Optimization with General Constraints

Guodong Ma()

^{School of Mathematics and Statistics & Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing, Yulin Normal University, Guangxi Yulin 537000}

Received:2019-03-22 Online:2020-06-26 Published:2020-07-15
Supported by:
the NSF of Guangxi Province(2018GXNSFAA281099);the NSFC(11771383);the Research Projects of Yulin Normal University(2019YJKY16);the Research Projects of Yulin Normal University(G20150010)

摘要/Abstract

摘要：

该文考虑求解带非线性不等式和等式约束的极大极小优化问题，借助半罚函数思想，提出了一个新的广义投影算法.该算法具有以下特点：由一个广义梯度投影显式公式产生的搜索方向是可行下降的；构造了一个新型的最优识别控制函数；在适当的假设条件下具有全局收敛性和强收敛性.最后，通过初步的数值试验验证了算法的有效性.

关键词: 非线性一般约束, 极大极小问题, 广义梯度投影算法, 全局收敛性, 强收敛性

Abstract:

In this paper, minimax optimization problems with inequality and equality constraints is discussed. The original problem is transformed into an associated simple problem with a penalty term and only inequality constraints, then a new generalized gradient projection algorithm is presented. The main characters of the proposed algorithm are as follows:the improved search direction is generated by only one generalized gradient projection explicit formula; the new optimal identification function is introduced; the algorithm is globally and strongly convergent under some mild assumptions. Finally, the numerical results show that the proposed algorithm is promising.

Key words: Nonlinear general constraints, Minimax optimization problems, Generalized gradient projection method, Global convergence, Strong convergence

中图分类号:

O221.2

马国栋. 一般约束极大极小优化问题一个强收敛的广义梯度投影算法[J]. 数学物理学报, 2020, 40(3): 641-649.

Guodong Ma. A Strongly Convergent Generalized Gradient Projection Method for Minimax Optimization with General Constraints[J]. Acta mathematica scientia,Series A, 2020, 40(3): 641-649.

参考文献

1	Yu Y H , Gao L . Nonmonotone line search algorithm for constrained minimax problems. J Optimiz Theory App, 2002, 115 (2): 419- 446
2	Jian J B , Zhang X L , Quan R , Ma Q . Generalized monotone line search SQP algorithm for constrained minimax problems. Optimization, 2009, 58 (1): 101- 131
3	Jian J B , Hu Q J , Tang C M . Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems. J Optimiz Theory App, 2014, 163 (3): 859- 883
4	Wang F S , Wang C L . An adaptive nonmonotone trust region method with curvilinear search for minimax problem. Appl Math Comput, 2013, 219, 8033- 8041
5	Ye F , Liu H W , Zhou S S , et al. A smoothing trust region Newton-CG method for minimax problem. Appl Math Comput, 2008, 199, 581- 589
6	Chi X N , Wei H J , Wan Z P , et al. Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search. Acta Math Sci, 2017, 37B (5): 1262- 1280
7	Obasanjo E , Tzallas-Regas G , Rustem B . An interior point algorithm for nonlinear minimax problems. J Optimiz Theory App, 2010, 144 (2): 291- 318
8	Mayne D Q , Polak E . Feasible directions algorithms for optimization problems with equality and inequality constraints. Math Program, 1976, 11 (1): 67- 80
9	Jian J B , Xu Q J , Han D L . A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints. Appl Math Comput, 2006, 182, 854- 870
10	Jian J B , Guo C H , Yang L F . A new generalized projection method of strongly sub-feasible directions for general constrained optimization. Pac J Optim, 2009, 5 (3): 507- 523
11	Rosen J B . The gradient projection method for nonlinear programming. Part I. Linear constraints. J Soc Ind Appl Math, 1960, 8 (1): 181- 217
12	Rosen J B . The gradient projection method for nonlinear programming. Part Ⅱ. Linear constraints. J Soc Ind Appl Math, 1961, 9 (4): 514- 532
13	朱志斌, 王硕, 简金宝. 非线性优化一个超线性收敛的广义投影型可行方向法. 应用数学学报, 2014, 37 (1): 179- 192
13	Zhu Z B , Wang S , Jian J B . A generalized projection feasible method with superlinear convergence for nonlinear optimization. Acta Math Appl Sin, 2014, 37 (1): 179- 192
14	简金宝. 光滑约束优化快速算法-理论分析与数值试验. 北京: 科学出版社, 2010
14	Jian J B . Fast Algorithms for Smooth Constrained Optimization-Theoretical Analysis and Numerical Experiments. Beijing: Science Press, 2010
15	Ma G D , Jian J B . An ε-generalized gradient projection method for nonlinear minimax problems. Nonlinear Dynam, 2014, 75 (4): 693- 700
16	Ma G D , Zhang Y F , Liu M X . A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints. J Inequal Appl, 2017, 2017, 51

[1]	刘鹏杰, 邵虎, 李佳宜, 董端端. 一个基于 BFGS 更新的惯性三项共轭梯度投影法[J]. 数学物理学报, 2025, 45(5): 1698-1710.
[2]	马小军, 陈富, 贾芝福. 基于非 Lipschitz 步长策略的临近分裂可行问题的强收敛性研究[J]. 数学物理学报, 2024, 44(4): 1052-1065.
[3]	简金宝, 代钰, 尹江华. 分裂可行性问题的一个惯性共轭梯度投影法[J]. 数学物理学报, 2024, 44(4): 1066-1079.
[4]	蔡宇, 周光辉. 一种 WYL 型谱共轭梯度法的全局收敛性[J]. 数学物理学报, 2024, 44(1): 173-184.
[5]	简金宝,林惠,马国栋. 大规模非凸不可分优化问题的分裂序列二次规划算法[J]. 数学物理学报, 2023, 43(4): 1284-1296.
[6]	刘鹏杰, 吴彦强, 邵枫, 张艳, 邵虎. 两个带重启方向的改进 HS 型共轭梯度法[J]. 数学物理学报, 2023, 43(2): 570-580.
[7]	潘庭葳,贺素香. 双重稀疏约束优化问题的一种贪婪单纯形算法[J]. 数学物理学报, 2022, 42(3): 920-933.
[8]	袁功林,吴宇伦,PhamHongtruong. 基于非单调线搜索的HS-DY形共轭梯度方法及在图像恢复中的应用[J]. 数学物理学报, 2022, 42(2): 605-620.
[9]	马国栋. 强Wolfe线搜索下的修正PRP和HS共轭梯度法[J]. 数学物理学报, 2021, 41(3): 837-847.
[10]	万成高. 随机环境中马氏链函数加权和的极限定理[J]. 数学物理学报, 2015, 35(1): 163-171.
[11]	陈加伟, 万仲平, 赵烈济. 可数族弱Bregman相对非扩展映像的收敛性分析[J]. 数学物理学报, 2014, 34(1): 70-79.
[12]	胡慧英, 曾六川. 两个平衡问题和可数无穷多非扩张映像公共不动点问题的新的迭代算法[J]. 数学物理学报, 2013, 33(5): 860-881.
[13]	胡朝明, 万中, 王旭. 一种新的非单调谱共轭梯度算法[J]. 数学物理学报, 2013, 33(1): 78-88.
[14]	周长银; 贺国平; 王永丽. 基于有效约束识别技术的一个SSLE算法及其收敛性分析[J]. 数学物理学报, 2007, 27(3): 535-540.
[15]	高自友, 任华玲, 贺国平. 无严格互补松驰条件的序列线性方程组新算法[J]. 数学物理学报, 2004, 24(3): 275-284.