PolyAR: A Highly Parallelizable Solver For Polynomial Inequality Constraints Using Convex Abstraction Refinement.
Wael FatnassiYasser ShoukryPublished in: ADHS (2021)
Keyphrases
- inequality constraints
- highly parallelizable
- convex quadratic
- constrained optimization
- nonlinear programming
- interior point methods
- equality constraints
- bounded treewidth
- linear programming
- linear constraints
- linear program
- least squares support vector machine
- constrained problems
- optimization problems
- variational inequalities
- optimality conditions