Relaxation-Based Bounds for Semi-Infinite Programs.
Alexander MitsosPanayiotis LemonidisCha Kun LeePaul I. BartonPublished in: SIAM J. Optim. (2008)
Keyphrases
- semi infinite
- semidefinite
- linear program
- optimality conditions
- semidefinite programming
- convex relaxation
- sufficient conditions
- objective function
- upper bound
- linear programming
- lower bound
- worst case
- higher dimensional
- multistage
- quadratic program
- finite dimensional
- convex optimization
- learning algorithm
- image classification
- np hard
- reinforcement learning