| [1] Rustem B, Nguyen Q. An algorithm for the inequality-constrained discrete minimax problem[J]. SIAM Journal on Optimization, 1998, 8:265-283.[2] Polak E, Royset J O and Womersley R S. Algorithms with Adaptive Smoothing for Finite minimax Problems[J]. Journal of Optimization Theory and Applications, 2003, 119(3):459-484.[3] Di Pillo G, Grippo L, Lucidi S. A smooth method for the finite minimax problem[J]. Math Program, 1993, 60:187-214.[4] Vardi A. New minimax algorithm[J]. J Optim Theory Appl, 1992, 75:613-634[5] Jian J B, Li J,Zheng H Y, Li J L. A superlinearly convergent norm-relaxed method of quasistrongly sub-feasible direction for inequality constrained minimax problems[J]. Applied Mathematics and Computation, 2014, 226:673-690.[6] He S X, Liu X F, Wang C M. A Nonlinear Lagrange Algorithm for minimax Problems with General Constraints[J]. Numerical Functional Analysis and Optimization, 2016, 37(6):680-698.[7] Zhu Z B, Cai X, Jian J B. An improved SQP algorithm for solving minimax problems[J]. Applied Mathematics Letters, 2009, 22(4):464-469.[8] 薛毅. 求解minimax优化问题的SQP方法[J].系统科学与数学, 2002, 22(3):355-364.[9] Wang F S. A hybrid algorithm for linearly constrained minimax Problems[J]. Annals of Operations Research, 2013, 206(1):501-525.[10] Wang F S, Wang C L, Wang L. A new trust-region algorithm for finite minimax problem[J]. Journal of Computational Mathematics, 2012, 30(3):262-278.[11] Fukushima M, Luo Z Q, Tseng P. A Sequential Quadratically Constrained Quadratic Programming Methods for Differentialable Convex minimization[J]. SIAM Journal on Optimization, 2003, 13(4):1098-1119.[12] Solodov M V. On the Sequential Quadratically Constrained Quadratic Programming Methods[J]. Mathematics of Operations Research, 2004, 29(1):64-79.[13] Yuan Y X, Sun W Y. Optimization Theory and Methods[M]. Beijing:Science Press, 1997.[14] Tang C M, Jian J B. Sequential Quadratically Constrained Quadratic Programming Method with an Augmented Lagrangian Line Search Function[J]. Journal of Computational and Applied Mathematics, 2008, 220(1-2):525-547.[15] 晁绵涛.非线性minimax问题的二次约束二次算法模型[J]. 广西大学硕士学位论文, 2007.[16] 刘美杏,唐春明,简金宝.不等式约束优化基于新型积极识别集的SQCQP算法[J]. 应用数学学报, 2015, 38(2):222-234.[17] Chao M T, Wang Z X, Liang Y M, Hu Q J. Quadratically Constraint Quadratical Algorithm Model for Nonlinear minimax Problems[J]. Applied Mathmatics and Computation, 2008, 205:247-262.[18] Jian J B, Chao M T. A sequential quadratically constrained quadratic programming method for uncostrained minimax problems[J]. Journal of Mathematical Analysis and Applications, 2010, 362:34-45.[19] Jian J B, Zheng H Y, Hu Q J,Tang C M. A new norn-relaxed method of strongly sub-feasible direction for inequality constrained optimization[J]. Applied Mathematics and Computation, 2005, 168:1-28.[20] Chen, X., Kostreva, M.M. A generalization of the norm-relaxed method of feasible directions[J]. Applied Mathematics and Computation, 1999, 102:257-273.[21] 简金宝.光滑约束优化快速算法-理论分析与数值试验[M].北京:科学出版社, 2010.[22] Jian J B, Quan R,Zhang X L. Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints[J]. Journal of Computational and Applied Mathematics, 2007, 205:406-429.[23] Napsu Karmitsa. Test problems for large-scale nonsmooth minimization[J]. Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, 2007, B4:1-12. |
