PolyAR: A Highly Parallelizable Solver For Polynomial Inequality Constraints Using Convex Abstraction Refinement.
Wael FatnassiYasser ShoukryPublished in: CoRR (2021)
Keyphrases
- inequality constraints
- highly parallelizable
- convex quadratic
- nonlinear programming
- constrained optimization
- interior point methods
- equality constraints
- bounded treewidth
- convex optimization
- optimality conditions
- machine learning
- decomposition algorithm
- objective function
- variational inequalities
- semidefinite programming
- constrained optimization problems
- constrained problems
- state space
- special case