On the Analytic Center Cutting Plane Method for the Discrete-Time Integral Quadratic Constraint Problem.
Dany Abou JaoudeMark C. PalframanMazen FarhoodPublished in: CDC (2019)
Keyphrases
- cutting plane method
- analytic center
- semidefinite
- primal dual
- interior point methods
- semidefinite programming
- cutting plane
- extreme points
- convex optimization
- linear programming
- linear programming relaxation
- interior point
- feasible set
- sufficient conditions
- objective function
- version space
- convex relaxation
- linear program
- linear constraints
- lower bound
- cutting plane algorithm
- quadratic programming
- feasible solution
- geometric properties
- computationally intensive