.png){kind=icon}
返回
Constraint partitioning for stability in path-constrained dynamic optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827500372390.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper an algorithm for extracting a stable differential-algebraic subsystem from a path-constrained dynamical system is proposed. The subsystem may be integrated directly by a differential-algebraic system integrator to evaluate constraints in shooting- or multiple shooting-type direct methods for solving path-constrained dynamic optimization problems. The algorithm appends algebraic constraints to the unconstrained ordinary differential equation subsystem based on a stability estimate for the resulting differential-algebraic system. The logarithmic norm is used to compute a stability estimate for index 1 and index 2 subsystems. The working of the algorithm is illustrated with examples.
Keyword:
dynamic optimization
stability
path constraints
constraint partitioning
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Régime et disponibilités alimentaires chez le Putois (Mustela putorius L.)食物体制和可用性在艾鼬（Mustela putorius L.）中
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容