A Self-Adaptive Trust Region Algorithm with Line Search Technique

2010 ◽  
Author(s):  
Wenjuan Wu ◽  
Lanping Chen ◽  
Baocong Jiao
Keyword(s):  
Line Search ◽  
Trust Region ◽  
Search Technique ◽  
Trust Region Algorithm ◽  
Line Search Technique ◽  
Self Adaptive

scholarly journals A Nonmonotone Weighting Self-Adaptive Trust Region Algorithm for Unconstrained Nonconvex Optimization

2015 ◽  
Vol 2015 ◽  
pp. 1-8
Author(s):  
Yunlong Lu ◽  
Weiwei Yang ◽  
Wenyu Li ◽  
Xiaowei Jiang ◽  
Yueting Yang
Keyword(s):  
Nonconvex Optimization ◽  
Line Search ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Search Technique ◽  
Trust Region Algorithm ◽  
Unconstrained Optimization Problems ◽  
Line Search Technique ◽  
Self Adaptive

A new trust region method is presented, which combines nonmonotone line search technique, a self-adaptive update rule for the trust region radius, and the weighting technique for the ratio between the actual reduction and the predicted reduction. Under reasonable assumptions, the global convergence of the method is established for unconstrained nonconvex optimization. Numerical results show that the new method is efficient and robust for solving unconstrained optimization problems.

Nonmonotone conic trust region method with line search technique for bound constrained optimization

2019 ◽  
Vol 53 (3) ◽  
pp. 787-805
Author(s):  
Lijuan Zhao
Keyword(s):  
Constrained Optimization ◽  
Line Search ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Affine Scaling ◽  
Search Technique ◽  
Region Method ◽  
Bound Constrained Optimization ◽  
Line Search Technique

In this paper, we propose a nonmonotone trust region method for bound constrained optimization problems, where the bounds are dealt with by affine scaling technique. Differing from the traditional trust region methods, the subproblem in our algorithm is based on a conic model. Moreover, when the trial point isn’t acceptable by the usual trust region criterion, a line search technique is used to find an acceptable point. This procedure avoids resolving the trust region subproblem, which may reduce the total computational cost. The global convergence and Q-superlinear convergence of the algorithm are established under some mild conditions. Numerical results on a series of standard test problems are reported to show the effectiveness of the new method.

scholarly journals A Trust-Region-Based BFGS Method with Line Search Technique for Symmetric Nonlinear Equations

2009 ◽  
Vol 2009 ◽  
pp. 1-22 ◽  
Author(s):  
Gonglin Yuan ◽  
Shide Meng ◽  
Zengxin Wei
Keyword(s):  
Nonlinear Equations ◽  
Line Search ◽  
Trust Region Method ◽  
Trust Region ◽  
Bfgs Method ◽  
Search Technique ◽  
Region Method ◽  
Global And Superlinear Convergence ◽  
Line Search Technique ◽  
The Given

A trust-region-based BFGS method is proposed for solving symmetric nonlinear equations. In this given algorithm, if the trial step is unsuccessful, the linesearch technique will be used instead of repeatedly solving the subproblem of the normal trust-region method. We establish the global and superlinear convergence of the method under suitable conditions. Numerical results show that the given method is competitive to the normal trust region method.

scholarly journals The Number Density Evolution of Extreme Emission Line Galaxies in 3D-HST: Results from a Novel Automated Line Search Technique for Slitless Spectroscopy

2018 ◽  
Vol 854 (1) ◽  
pp. 29 ◽  
Author(s):  
Michael V. Maseda ◽  
Arjen van der Wel ◽  
Hans-Walter Rix ◽  
Ivelina Momcheva ◽  
Gabriel B. Brammer ◽  
...  
Keyword(s):  
Emission Line ◽  
Line Search ◽  
Number Density ◽  
Search Technique ◽  
Density Evolution ◽  
Line Search Technique ◽  
Emission Line Galaxies ◽  
Automated Line

A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems

2019 ◽  
Vol 36 (04) ◽  
pp. 1950017 ◽  
Author(s):  
Wen-Li Dong ◽  
Xing Li ◽  
Zheng Peng
Keyword(s):  
Simulated Annealing ◽  
Unconstrained Optimization ◽  
Gradient Method ◽  
Line Search ◽  
High Efficiency ◽  
Optimization Problems ◽  
Search Technique ◽  
Unconstrained Optimization Problems ◽  
Armijo Line Search ◽  
Line Search Technique

In this paper, we propose a simulated annealing-based Barzilai–Borwein (SABB) gradient method for unconstrained optimization problems. The SABB method accepts the Barzilai–Borwein (BB) step by a simulated annealing rule. If the BB step cannot be accepted, the Armijo line search is used. The global convergence of the SABB method is established under some mild conditions. Numerical experiments indicate that, compared to some existing BB methods using nonmonotone line search technique, the SABB method performs well with high efficiency.

scholarly journals A Novel Self-Adaptive Trust Region Algorithm for Unconstrained Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Yunlong Lu ◽  
Wenyu Li ◽  
Mingyuan Cao ◽  
Yueting Yang
Keyword(s):  
Objective Function ◽  
Unconstrained Optimization ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Convergence Properties ◽  
Trust Region Algorithm ◽  
Unconstrained Optimization Problems ◽  
Piecewise Function ◽  
Self Adaptive

A new self-adaptive rule of trust region radius is introduced, which is given by a piecewise function on the ratio between the actual and predicted reductions of the objective function. A self-adaptive trust region method for unconstrained optimization problems is presented. The convergence properties of the method are established under reasonable assumptions. Preliminary numerical results show that the new method is significant and robust for solving unconstrained optimization problems.

Sign in / Sign up

Export Citation Format

Share Document