Symbolic elimination in dynamic optimization based on block-triangular ordering
DOI10.1080/10556788.2016.1270944zbMath1391.49065OpenAlexW2577765374MaRDI QIDQ4638913
Johan Akesson, Fredrik Magnusson
Publication date: 2 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://lup.lub.lu.se/record/c6fd37fe-6325-43c8-9dbd-e13a255b4771
differential-algebraic equationsnonlinear programmingdynamic optimizationtearingmodelicasparsity preservationblock-triangular ordering
Symbolic computation and algebraic computation (68W30) Numerical methods based on nonlinear programming (49M37) Implicit ordinary differential equations, differential-algebraic equations (34A09)
Uses Software
Cites Work
- Efficient parallel solution of large-scale nonlinear dynamic optimization problems
- A manifold-based approach to sparse global constraint satisfaction problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The Elimination form of the Inverse and its Application to Linear Programming
- Survey of Numerical Methods for Trajectory Optimization
- Practical Methods for Optimal Control and Estimation Using Nonlinear Programming
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- The design of MA48
- Index Reduction in Differential-Algebraic Equations Using Dummy Derivatives
- Nonlinear Programming
- The ESA NLP Solver WORHP
- Depth-First Search and Linear Graph Algorithms
- Nested Dissection of a Regular Finite Element Mesh
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Symbolic elimination in dynamic optimization based on block-triangular ordering
