.png){kind=icon}
返回
Higher-order interior point methods for convex nonlinear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2023.108475.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper extends the concept of higher-order search directions within interior point methods to convex nonlinear programming. This includes the mathematical framework needed to compute the higher-order derivatives. The paper also highlights some special cases where the computation of these higher-order derivatives is simplified and a dimensional lifting procedure for transforming a large number of general nonlinear problems into one of these more efficient forms. The paper further describes the algorithmic development required to employ these higher-order search directions in a practical algorithm. Computational results are presented for a large number of test problems, highlighting higher-order methods' strong potential for decreasing iteration count and their case-by-case potential for decreasing CPU time.
Keyword:
Interior point methods
Higher-order search directions
Convex programming
Nonlinear programming
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
分享收藏CasADi: a software framework for nonlinear optimization and optimal controlCasADi: 非线性优化和最优控制的软件框架
PREAI
分享收藏SciPy 1.0: fundamental algorithms for scientific computing in PythonSciPy 1.0: Python中科学计算的基本算法.png)
NATURE METHODS
OAAI
NATURE METHODSIF32.1
OAAI分享收藏Trends in coronary risk factors and electrocardiogram findings from 1977 to 2009 with 10-year mortality in Japanese elderly males – The Tanushimaru Study1977年至2009年日本老年男性冠状动脉危险因素及心电图发现的趋势与10年死亡率——Tanushimaru研究OAAI
OAAI分享收藏
查看更多内容