An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints.
Adil SalimLaurent CondatDmitry KovalevPeter RichtárikPublished in: AISTATS (2022)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- k means
- globally optimal
- matching algorithm
- detection algorithm
- computational cost
- convex minimization
- np hard
- multiple constraints
- preprocessing
- optimal parameters
- computational complexity
- particle swarm optimization algorithm
- segmentation algorithm
- optimization algorithm
- learning algorithm
- clustering method
- linear programming
- optimal path
- optimality criteria
- path planning
- image matching
- graph cuts
- neural network
- cost function
- search space
- objective function
- similarity measure
- image segmentation
- genetic algorithm