On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format.
Thorsten RohwedderAndré UschmajewPublished in: SIAM J. Numer. Anal. (2013)
Keyphrases
- optimization problems
- convex programming
- convex optimization problems
- mathematical programming
- np complete
- stationary points
- convex relaxation
- problems involving
- stopping criteria
- semi definite programming
- discrete optimization
- combinatorial optimization
- dimensionality reduction
- globally optimal
- metadata
- convex optimization
- quadratic program
- optimization algorithm
- linear programming
- globally convergent
- higher order