信任域
迭代函数
数学
数学优化
二次方程
二次规划
序列二次规划
约束(计算机辅助设计)
简单(哲学)
椭球体
内点法
非线性系统
功能(生物学)
可行区
主题(文档)
应用数学
缩小
趋同(经济学)
非线性规划
计算机科学
数学分析
经济
图书馆学
天文
半径
物理
进化生物学
量子力学
认识论
几何学
生物
经济增长
计算机安全
哲学
作者
Thomas F. Coleman,Yuying Li
摘要
We propose a new trust region approach for minimizing a nonlinear function subject to simple bounds. Unlike most existing methods, our proposed method does not require that a quadratic programming subproblem, with inequality constraints, be solved in each iteration. Instead, a solution to a trust region subproblem is defined by minimizing a quadratic function subject only to an ellipsoidal constraint. The iterates generated are strictly feasible. Our proposed method reduces to a standard trust region approach for the unconstrained problem when there are no upper or lower bounds on the variables. Global and local quadratic convergence is established. Preliminary numerical experiments are reported indicating the practical viability of this approach.
科研通智能强力驱动
Strongly Powered by AbleSci AI