A globally convergent BFGS method with nonmonotone line search for non-convex minimization

被引:11
|
作者
Xiao, Yunhai [1 ,2 ]
Sun, Huijuan [2 ]
Wang, Zhiguo [2 ]
机构
[1] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
[2] Henan Univ, Inst Appl Math, Coll Math & Informat Sci, Kaifeng 475004, Peoples R China
关键词
Non-convex minimization; Secant equation; BFGS method; Nonmonotone line search; Global convergence; QUASI-NEWTON METHODS;
D O I
10.1016/j.cam.2008.10.065
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we propose a modified BFGS (Broyden-Fletcher-Goldfarb-Shanno) method with nommonotone line search for unconstrained optimization. Under some mild conditions, we show that the method is globally convergent without a convexity assumption on the objective function. We also report some preliminary numerical results to show the efficiency of the proposed method. Crown Copyright (C) 2008 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:95 / 106
页数:12
相关论文
共 50 条
  • [31] Non-convex clustering via proximal alternating linearized minimization method
    Xie, Ting
    Chen, Feiyu
    [J]. INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING, 2018, 16 (02)
  • [32] A Recursive Trust-Region Method for Non-Convex Constrained Minimization
    Gross, Christian
    Krause, Rolf
    [J]. DOMAIN DECOMPOSITION METHODS IN SCIENCE AND ENGINEERING XVIII, 2009, 70 : 137 - 144
  • [33] Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
    Noll, Dominikus
    [J]. COMPUTATIONAL AND ANALYTICAL MATHEMATICS: IN HONOR OF JONATHAN BORWEIN'S 60TH BIRTHDAY, 2013, 50 : 555 - 592
  • [34] Non-convex minimization -: The case of vector fields
    Brüning, E
    [J]. PARTIAL DIFFERENTIAL EQUATIONS AND SPECTRAL THEORY, 2001, 126 : 17 - 23
  • [35] Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
    Su, Menglong
    Li, Jianhua
    Xu, Zhonghai
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2014,
  • [36] Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
    Menglong Su
    Jianhua Li
    Zhonghai Xu
    [J]. Journal of Inequalities and Applications, 2014
  • [37] Efficient Regret Minimization in Non-Convex Games
    Hazan, Elad
    Singh, Karan
    Zhang, Cyril
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [38] A globally convergent improved BFGS method for generalized Nash equilibrium problems
    Singh A.
    Ghosh D.
    [J]. SeMA Journal, 2024, 81 (2) : 235 - 261
  • [39] A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
    Ming Li
    Hongwei Liu
    Zexian Liu
    [J]. Numerical Algorithms, 2018, 79 : 195 - 219
  • [40] A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
    Li, Ming
    Liu, Hongwei
    Liu, Zexian
    [J]. NUMERICAL ALGORITHMS, 2018, 79 (01) : 195 - 219