An interior algorithm for nonlinear optimization that combines line search and trust region steps
摘要:
An interior-point method for nonlinear programming is presented. It enjoys the flexibility of switching between a line search method that computes steps by factoring the primal-dual equations and a trust region method that uses a conjugate gradient iteration. Steps computed by direct factorization are always tried first, but if they are deemed ineffective, a trust region iteration that guarantees progress toward stationarity is invoked. To demonstrate its effectiveness, the algorithm is implemented in the Knitro [6,28] software package and is extensively tested on a wide selection of test problems.
展开
关键词:
UNCONSTRAINED TESTING ENVIRONMENT Q-SUPERLINEAR CONVERGENCE CONSTRAINED OPTIMIZATION POINT ALGORITHM
DOI:
10.1007/s10107-004-0560-5
被引量:
年份:
2006
通过文献互助平台发起求助,成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
来源期刊
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用!