An inexact interior point method for optimization of differential algebraic systems.

Emil Klintberg Sebastien Gros

Published in: Comput. Chem. Eng. (2016)

Keyphrases

lower bound
interior point methods
convex programming
higher order
optimization problems
linear program
semidefinite
linear programming
convex optimization
constrained optimization
computationally intensive
primal dual
semidefinite programming