Interior point gradient algorithm for totally nonnegative least-squares problems in inequality sense.
Maziar SalahiAkram TaatiPublished in: Int. J. Comput. Math. (2014)
Keyphrases
- least squares
- interior point
- linear programming
- objective function
- optimal solution
- semidefinite programming
- worst case
- simulated annealing
- nonnegative matrix factorization
- primal dual
- interior point methods
- approximate solutions
- dynamic programming
- linear programming problems
- optimization problems
- learning algorithm
- quadratic programming
- linear systems
- expectation maximization
- negative matrix factorization
- globally optimal
- knapsack problem
- convex hull
- np hard
- special case
- computational complexity
- reinforcement learning
- clustering algorithm