.png){kind=icon}
返回
AN INTERIOR-POINT ALGORITHM FOR LARGE-SCALE NONLINEAR OPTIMIZATION WITH INEXACT STEP COMPUTATIONS
.png){kind=icon}
PRE
AI
DOI：10.1137/090747634.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses iterative linear system solvers. Inexact step computations are supported in order to save computational expense during each iteration. The algorithm is an interior-point approach derived from an inexact Newton method for equality constrained optimization proposed by Curtis, Nocedal, and Wachter [SIAM J. Optim., 20 (2009), pp. 1224-1249], with additional functionality for handling inequality constraints. The algorithm is shown to be globally convergent under loose assumptions. Numerical results are presented for nonlinear optimization test set collections and a pair of PDE-constrained model problems.
Keyword:
large-scale optimization
constrained optimization
interior-point methods
nonconvex optimization
trust regions
inexact linear system solvers
Krylov subspace methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
On large-scale diagonalization techniques for the Anderson model of localization.png)
SIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAI分享收藏Cytotoxic and antimicrobial activities of secondary metabolites isolated from the deep-sea-derived Actinoalloteichus cyanogriseus 12A223 Biotech
OAAI
3 BiotechIF0
OAAI分享收藏分享收藏
查看更多内容