A fast dual proximal gradient algorithm for convex minimization and applications.
Amir BeckMarc TeboullePublished in: Oper. Res. Lett. (2014)
Keyphrases
- experimental evaluation
- times faster
- detection algorithm
- improved algorithm
- learning algorithm
- preprocessing
- matching algorithm
- k means
- theoretical analysis
- np hard
- computational cost
- global convergence
- optimal solution
- dynamic programming
- cost function
- gradient method
- gradient information
- convex minimization
- recognition algorithm
- steepest descent method
- linear programming
- hybrid algorithm
- clustering method
- expectation maximization
- worst case
- wavelet transform
- search space
- association rules
- image segmentation