DC Proximal Newton for Non-Convex Optimization Problems.
Alain RakotomamonjyRémi FlamaryGilles GassoPublished in: CoRR (2015)
Keyphrases
- convex optimization problems
- interior point methods
- convex optimization
- primal dual
- linear programming
- linear program
- optimization problems
- structured sparsity
- learning problems
- semidefinite programming
- quadratic programming
- approximation algorithms
- computationally intensive
- linear systems
- evolutionary algorithm
- convergence rate
- total variation
- learning styles
- low rank
- solving problems
- active learning
- data mining
- data sets