A SUPERLINEARLY CONVERGENT TRUST REGION ALGORITHM FOR LC^1 CONSTRAINED OPTIMIZATION PROBLEMS  被引量:3

A SUPERLINEARLY CONVERGENT TRUST REGION ALGORITHM FOR LC^1 CONSTRAINED OPTIMIZATION PROBLEMS

在线阅读下载全文

作  者:欧宜贵 侯定丕 

机构地区:[1]Department of Applied Mathematics Hainan University, Haikou 570228, China [2]Department of Mathematics University of Science and Technology of China, Hefei 230026, China

出  处:《Acta Mathematica Scientia》2005年第1期67-80,共14页数学物理学报(B辑英文版)

基  金:ThispaperissupportedbytheNNSFofChina(10401010)

摘  要:In this paper, a new trust region algorithm for nonlinear equality constrained LC1 optimization problems is given. It obtains a search direction at each iteration not by solving a quadratic programming subprobiem with a trust region bound, but by solving a system of linear equations. Since the computational complexity of a QP-Problem is in general much larger than that of a system of linear equations, this method proposed in this paper may reduce the computational complexity and hence improve computational efficiency. Furthermore, it is proved under appropriate assumptions that this algorithm is globally and super-linearly convergent to a solution of the original problem. Some numerical examples are reported, showing the proposed algorithm can be beneficial from a computational point of view.In this paper, a new trust region algorithm for nonlinear equality constrained LC1 optimization problems is given. It obtains a search direction at each iteration not by solving a quadratic programming subprobiem with a trust region bound, but by solving a system of linear equations. Since the computational complexity of a QP-Problem is in general much larger than that of a system of linear equations, this method proposed in this paper may reduce the computational complexity and hence improve computational efficiency. Furthermore, it is proved under appropriate assumptions that this algorithm is globally and super-linearly convergent to a solution of the original problem. Some numerical examples are reported, showing the proposed algorithm can be beneficial from a computational point of view.

关 键 词:LC1 optimization ODE methods trust region methods superlinear convergence 

分 类 号:O224[理学—运筹学与控制论]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象