Active set strategy for high-dimensional non-convex sparse optimization problems.
Aurelie BoisbunonRémi FlamaryAlain RakotomamonjyPublished in: ICASSP (2014)
Keyphrases
- high dimensional
- active set
- optimization problems
- dictionary learning
- efficient implementation
- sparse coding
- evolutionary algorithm
- cost function
- low dimensional
- nearest neighbor
- convex optimization
- dimensionality reduction
- metaheuristic
- sparse representation
- feature space
- optimization methods
- variable selection
- nonnegative matrix factorization
- interior point
- high dimensional data
- convex hull
- data sets
- traveling salesman problem
- linear programming
- data points
- optimal solution
- interior point methods
- semidefinite
- objective function