Solving Fractional Polynomial Problems by Polynomial Optimization Theory.
Andrea PizzoAlessio ZapponeLuca SanguinettiPublished in: CoRR (2018)
Keyphrases
- optimization problems
- combinatorial optimization
- algebraic geometry
- polynomial equations
- nonlinear programming
- problems involving
- np complete
- polynomial hierarchy
- solving complex
- global optimization problems
- theoretical framework
- sparse linear systems
- optimization algorithm
- solving problems
- convex relaxation
- convex programming
- convex optimization problems
- redundancy allocation
- convex quadratic programming
- discrete optimization
- search heuristics
- low order
- knapsack problem
- decision problems
- particle swarm optimization