Yapa: Accelerated Proximal Algorithm for Convex Composite Problems.
Giovanni ChierchiaMireille El GhechePublished in: ICASSP (2021)
Keyphrases
- experimental evaluation
- high accuracy
- search space
- learning algorithm
- globally optimal
- test problems
- benchmark problems
- computational cost
- k means
- np hard
- dynamic programming
- objective function
- optimal solution
- times faster
- convex relaxation
- matching algorithm
- detection algorithm
- worst case
- significant improvement
- np complete
- optimization algorithm
- simulated annealing
- preprocessing
- alternating direction method of multipliers
- optimal or near optimal
- quadratic optimization problems
- theoretical guarantees
- neural network
- primal dual
- clustering method
- particle swarm optimization
- cost function