A smoothing trust-region Newton-CG method for minimax problem

被引:56
|
作者
Ye, Feng [1 ]
Liu, Hongwei [1 ]
Zhou, Shuisheng [1 ]
Liu, Sanyang [1 ]
机构
[1] Xidian Univ, Sch Sci, Dept Appl Math, Xian 710071, Peoples R China
关键词
finite minimax problem; smooth technique; unconstrained optimization; SQP algorithm; trust-region Newton-CG algorithm;
D O I
10.1016/j.amc.2007.10.070
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper presents a smooth approximate method with a new smoothing technique and a standard unconstrained minimization algorithm in the solution to the finite minimax problems. The new smooth approximations only replace the original problem in some neighborhoods of the kink points with a twice continuously differentiable function, its gradient and Hessian matrix are the combination of the first and the second order derivative of the original functions respectively. Compared to the other smooth functions such as the exponential penalty function, the remarkable advantage of the new smooth function is that the combination coefficients of its gradient and the Hessian matrix have sparse properties furthermore, the maximal possible difference value between the optimal values of the smooth approximate problem and the original one is determined by a fixed parameter selected previous. An algorithm to solve the equivalent unconstrained problem by using the trust-region Newton conjugate gradient method is proposed in the solution process finally, some numerical examples are reported to compare the proposed algorithm with SQP algorithm that implements in MATLAB toolbox and the algorithm in [E. Polak, J. O. Royset, R. S. Womersley, Algorithms with adaptive smoothing for finite minimax problems, Journal of Optimization Theory and Applications 119 (3) (2003) 459-484] based on the exponential penalty function, the numerical results prove that the proved algorithm is efficient. (c) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:581 / 589
页数:9
相关论文
共 50 条
  • [21] THE CONVERGENCE OF THE GENERALIZED LANCZOS TRUST-REGION METHOD FOR THE TRUST-REGION SUBPROBLEM
    Jia, Zhongxiao
    Wang, Fa
    SIAM JOURNAL ON OPTIMIZATION, 2021, 31 (01) : 887 - 914
  • [22] An active set Newton-CG method for l1 optimization
    Cheng, Wanyou
    Dai, Yu-Hong
    APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2021, 50 : 303 - 325
  • [23] A PROXIMAL QUASI-NEWTON TRUST-REGION METHOD FOR NONSMOOTH REGULARIZED OPTIMIZATION
    Aravkin, Aleksandr Y.
    Baraldi, Robert
    Orban, Dominique
    SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (02) : 900 - 929
  • [24] OPTIMALITY CONDITIONS AND A SMOOTHING TRUST REGION NEWTON METHOD FOR NONLIPSCHITZ OPTIMIZATION
    Chen, Xiaojun
    Niu, Lingfeng
    Yuan, Yaxiang
    SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (03) : 1528 - 1552
  • [25] A SEMISMOOTH NEWTON-CG METHOD FOR CONSTRAINED PARAMETER IDENTIFICATION IN SEISMIC TOMOGRAPHY
    Boehm, Christian
    Ulbrich, Michael
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (05): : S334 - S364
  • [26] A Riemannian inexact Newton-CG method for stochastic inverse singular value problems
    Ma, Ru-Ru
    Bai, Zheng-Jian
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2021, 28 (01)
  • [27] A truncated aggregate smoothing Newton method for minimax problems
    Xiao, Yu
    Yu, Bo
    APPLIED MATHEMATICS AND COMPUTATION, 2010, 216 (06) : 1868 - 1879
  • [28] A spline smoothing Newton method for finite minimax problems
    Dong, Li
    Yu, Bo
    JOURNAL OF ENGINEERING MATHEMATICS, 2015, 93 (01) : 145 - 158
  • [29] A spline smoothing Newton method for finite minimax problems
    Li Dong
    Bo Yu
    Journal of Engineering Mathematics, 2015, 93 : 145 - 158
  • [30] A Quasi-Newton Trust-Region Method for Well Location Optimization Under Uncertainty
    Eltahan, Esmail
    Alpak, Faruk Omer
    Sepehrnoori, Kamy
    SPE Journal, 2024, 29 (10): : 5559 - 5575