New line search methods for unconstrained optimization

被引:32
作者
Yuan, Gonglin [1 ]
Wei, Zengxin [1 ]
机构
[1] Guangxi Univ, Coll Math & Informat Sci, Nanning 530004, Guangxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Unconstrained optimization; Line search method; Global convergence; R-linear convergence; Probability; QUASI-NEWTON METHODS; TRUST REGION ALGORITHM; CONVERGENCE PROPERTIES; CONSTRAINED MINIMIZATION; SUPERLINEAR CONVERGENCE; REGRESSION; BARZILAI;
D O I
10.1016/j.jkss.2008.05.004
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
It is well known that the search direction plays a main role in the line search method. In this paper, we propose a new search direction together with the Wolfe line search technique and one nonmonotone line search technique for solving unconstrained optimization problems. The given methods possess sufficiently descent property without carrying out any line search rule. The convergent results are established under suitable conditions. For numerical results, analysis of one probability shows that the new methods are more effective, robust, and stable, than other similar methods. Numerical results of two statistical problems also show that the presented methods are more interesting than other normal methods. (C) 2008 The Korean Statistical Society. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:29 / 39
页数:11
相关论文
共 50 条
[31]   NONMONOTONE CURVED SEARCH METHODS FOR UNCONSTRAINED OPTIMIZATION [J].
邓乃扬 ;
肖奕 ;
周方俊 .
Numerical Mathematics A Journal of Chinese Universities(English Series), 1992, (01) :34-48
[32]   A new nonmonotone adaptive trust region line search method for unconstrained optimization [J].
Wang, Xinyi ;
Ding, Xianfeng ;
Qu, Quan .
JOURNAL OF MATHEMATICS IN INDUSTRY, 2020, 10 (01)
[33]   A new nonmonotone adaptive trust region line search method for unconstrained optimization [J].
Xinyi Wang ;
Xianfeng Ding ;
Quan Qu .
Journal of Mathematics in Industry, 10
[34]   The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems [J].
Liu, Liying ;
Wei, Zengxin ;
Wu, Xiaoping .
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2010, 23 (04) :861-872
[35]   MULTIPLE USE OF BACKTRACKING LINE SEARCH IN UNCONSTRAINED OPTIMIZATION [J].
Ivanov, Branislav ;
Shaini, Bilall, I ;
Stanimirovic, Predrag S. .
FACTA UNIVERSITATIS-SERIES MATHEMATICS AND INFORMATICS, 2020, 35 (05) :1417-1438
[36]   Adaptive nonmonotone line search method for unconstrained optimization [J].
Qunyan Zhou ;
Wenyu Sun .
Frontiers of Mathematics in China, 2008, 3 :133-148
[37]   Adaptive nonmonotone line search method for unconstrained optimization [J].
Zhou, Qunyan ;
Sun, Wenyu .
FRONTIERS OF MATHEMATICS IN CHINA, 2008, 3 (01) :133-148
[38]   Two New Conjugate Gradient Methods for Unconstrained Optimization [J].
Feng, Huantao ;
Xiao, Wei .
PROCEEDINGS OF 2008 INTERNATIONAL PRE-OLYMPIC CONGRESS ON COMPUTER SCIENCE, VOL II: INFORMATION SCIENCE AND ENGINEERING, 2008, :462-465
[39]   A new family of conjugate gradient methods for unconstrained optimization [J].
Ming Li ;
Hongwei Liu ;
Zexian Liu .
Journal of Applied Mathematics and Computing, 2018, 58 :219-234
[40]   A new family of conjugate gradient methods for unconstrained optimization [J].
Li, Ming ;
Liu, Hongwei ;
Liu, Zexian .
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2018, 58 (1-2) :219-234