A conditional gradient method with linear rate of convergence for solving convex linear systems.
Amir BeckMarc TeboullePublished in: Math. Methods Oper. Res. (2004)
Keyphrases
- linear systems
- gradient method
- sparse linear systems
- convergence rate
- convex formulation
- sufficient conditions
- dynamical systems
- step size
- linear equations
- convergence speed
- negative matrix factorization
- convex optimization
- optimization methods
- coefficient matrix
- neural network
- dimensionality reduction
- interior point methods
- feature selection
- learning algorithm
- machine learning