Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming.
Patrick CousotPublished in: VMCAI (2005)
Keyphrases
- semidefinite programming
- lagrangian relaxation
- linear programming
- feasible solution
- integer programming
- column generation
- interior point methods
- lower bound
- dynamic programming
- primal dual
- linear program
- np hard
- lower and upper bounds
- nonlinear programming
- objective function
- maximum margin
- branch and bound algorithm
- optimal solution
- convex programming
- upper bound
- machine learning