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 条
[11]   A new nonmonotone line search technique for unconstrained optimization [J].
Yu, Zhensheng ;
Pu, Dingguo .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2008, 219 (01) :134-144
[12]   A New Supermemory Gradient Method without Line Search for Unconstrained Optimization [J].
Liu, June ;
Liu, Huanbin ;
Zheng, Yue .
SIXTH INTERNATIONAL SYMPOSIUM ON NEURAL NETWORKS (ISNN 2009), 2009, 56 :641-647
[13]   A Non-monotone Line Search Algorithm for Unconstrained Optimization [J].
Hu, Sheng-Long ;
Huang, Zheng-Hai ;
Lu, Nan .
JOURNAL OF SCIENTIFIC COMPUTING, 2010, 42 (01) :38-53
[14]   Singly diagonally implicit Runge-Kutta methods combining line search techniques for unconstrained optimization [J].
Luo, XL .
JOURNAL OF COMPUTATIONAL MATHEMATICS, 2005, 23 (02) :153-164
[15]   A nonmonotone trust region method with new inexact line search for unconstrained optimization [J].
Jinghui Liu ;
Changfeng Ma .
Numerical Algorithms, 2013, 64 :1-20
[16]   A nonmonotone trust region method with new inexact line search for unconstrained optimization [J].
Liu, Jinghui ;
Ma, Changfeng .
NUMERICAL ALGORITHMS, 2013, 64 (01) :1-20
[17]   A filter-line-search method for unconstrained optimization [J].
Wang Z. ;
Zhu D. .
Journal of Applied Mathematics and Computing, 2010, 34 (1-2) :329-342
[18]   A DWINDLING FILTER LINE SEARCH METHOD FOR UNCONSTRAINED OPTIMIZATION [J].
Chen, Yannan ;
Sun, Wenyu .
MATHEMATICS OF COMPUTATION, 2015, 84 (291) :187-208
[19]   A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization [J].
Li, Ming ;
Liu, Hongwei ;
Liu, Zexian .
NUMERICAL ALGORITHMS, 2018, 79 (01) :195-219
[20]   A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization [J].
Ming Li ;
Hongwei Liu ;
Zexian Liu .
Numerical Algorithms, 2018, 79 :195-219