Polynomial optimization methods for determining lower bounds on decentralized assignability.
Alborz AlavianMichael RotkowitzPublished in: Allerton (2016)
Keyphrases
- optimization methods
- lower bound
- upper bound
- optimization method
- optimization problems
- simulated annealing
- objective function
- global convergence
- stochastic methods
- trust region
- unconstrained optimization
- peer to peer
- branch and bound
- efficient optimization
- average case complexity
- lower and upper bounds
- particle swarm
- optimization approaches
- direct optimization
- np hard
- optimal solution
- continuous optimization
- neural network
- quasi newton
- distributed systems
- constant factor approximation algorithm
- inverse problems
- optimization algorithm
- linear programming
- information retrieval