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 条
[41]   Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization [J].
Narushima, Yasushi ;
Yabe, Hiroshi .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2012, 236 (17) :4303-4317
[42]   Combining nonmonotone conic trust region and line search techniques for unconstrained optimization [J].
Cui, Zhaocheng ;
Wu, Boying ;
Qu, Shaojian .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2011, 235 (08) :2432-2441
[43]   A NEW COEFFICIENT OF CONJUGATE GRADIENT METHODS FOR NONLINEAR UNCONSTRAINED OPTIMIZATION [J].
Mohamed, Nur Syarafina ;
Mamat, Mustafa ;
Mohamad, Fatma Susilawati ;
Rivaie, Mohd .
JURNAL TEKNOLOGI, 2016, 78 (6-4) :131-136
[44]   A New Conjugate Gradient Method with Sufficient Descent without any Line Search for Unconstrained Optimization [J].
Omer, Osman ;
Rivaie, Mohd ;
Mamat, Mustafa ;
Amani, Zahrahtul .
2ND ISM INTERNATIONAL STATISTICAL CONFERENCE 2014 (ISM-II): EMPOWERING THE APPLICATIONS OF STATISTICAL AND MATHEMATICAL SCIENCES, 2015, 1643 :602-608
[45]   A THREE-TERM CONJUGATE GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION [J].
Moyi, Aliyu Usman ;
Leong, Wah June .
PACIFIC JOURNAL OF OPTIMIZATION, 2016, 12 (03) :587-601
[46]   A comparison of Quasi-Newton methods considering line search conditions in unconstrained minimization [J].
Kiran, Kadir .
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2022, 43 (08) :2031-2053
[47]   A nonmonotone conic trust region method based on line search for solving unconstrained optimization [J].
Qu, Shao-Jian ;
Zhang, Qing-Pu ;
Yang, Yue-Ting .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 224 (02) :514-526
[48]   An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem [J].
Li, Qun ;
Zheng, Bing ;
Zheng, Yutao .
APPLIED MATHEMATICS LETTERS, 2019, 98 :74-80
[49]   The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems [J].
Liying Liu ;
Zengxin Wei ;
Xiaoping Wu .
Journal of Systems Science and Complexity, 2010, 23 :861-872
[50]   THE CONVERGENCE OF A NEW MODIFIED BFGS METHOD WITHOUT LINE SEARCHES FOR UNCONSTRAINED OPTIMIZATION OR COMPLEXITY SYSTEMS [J].
Liying LIU College of Mathematics ScienceLiaocheng UniversityLiaocheng China Zengxin WEI College of Mathematics and Information ScienceGuangxi UniversityNanning China Xiaoping WU School of ManagementXian Jiaotong UniversityXian China .
JournalofSystemsScience&Complexity, 2010, 23 (04) :861-872