An interior-point method for efficient solution of block-structured NLP problems using an implicit Schur-complement decomposition.
Jia KangYankai CaoDaniel P. WordCarl D. LairdPublished in: Comput. Chem. Eng. (2014)
Keyphrases
- interior point methods
- coefficient matrix
- convex programming
- solving problems
- interior point
- linear programming problems
- linear systems
- quadratic programming
- inequality constraints
- convex optimization
- primal dual
- semidefinite programming
- cutting plane method
- semidefinite
- mixed integer
- linear programming
- nonlinear programming
- variational inequalities
- linear program