On inner iterations of the joint bidiagonalization based algorithms for solving large scale linear discrete ill-posed problems.
Haibo LiPublished in: CoRR (2020)
Keyphrases
- optimization problems
- computationally expensive
- data structure
- search algorithm
- computational complexity
- discrete optimization
- combinatorial optimization
- linear models
- quadratic programming
- hybrid algorithms
- neural network
- convex optimization problems
- discrete data
- linear space
- iterative algorithms
- convergence rate
- computationally efficient
- computational cost
- objective function