TR方法比LS方法收敛速度快

【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

TR方法中有几个参数需要选择:

  1. 近似模型 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

  2. 可信赖区域  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)
  3. 求解参数  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)
  • 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

when 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记),Taylor-series expansion of f around 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记),which is 

                                          【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) 

where  t is some scalar in the interval (0,1).

By using an approximation 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) to the Hessian in the second-order term:

                                                          【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) 

 Then we seek a solution of subproblem:

                                                        【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) 

                                                               【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

The difference between  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  and 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) is 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) , which is small when p is small.

  •  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

 Let 

                                                                【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

 

1.if  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) is negative , the newe value  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  is greater than 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) ,  so the step must be rejected.,because step  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) is  obtained  by minimizing the model  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) . 

2.if  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  is close to 1, so it safe to expand the trust region.

3.if  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  is postive but significantly smaller than 1,we do not alter the trust region.

4.if  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  is close to 0, we shrink the trust region.

【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

  • 专注于求解子问题: 

We sometimes drop the interation subscript k and restate the problem as follows:

                                                        【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)       

                                                                【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)                             

if and only if

                                                          【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

 (4.8b) is a complementarity condition that states at least one of 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  and (【Numberical Optimization】4 Trust-Region Methods (zen学习笔记))  must be  0.

                         

                        【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

When   【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  ,【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)  lies strictly inside the trust region,we must have 【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) .

When   【Numberical Optimization】4 Trust-Region Methods (zen学习笔记) or  【Numberical Optimization】4 Trust-Region Methods (zen学习笔记),  we have   【Numberical Optimization】4 Trust-Region Methods (zen学习笔记),  then  we get 

                                                            【Numberical Optimization】4 Trust-Region Methods (zen学习笔记)

 

 Finally we get p.

 


4.1  Algotithms based on  the Cauchy point


 

 

相关文章: