On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems.
Gongyun ZhaoJie SunPublished in: Comput. Optim. Appl. (1999)
Keyphrases
- high order
- linear complementarity problem
- interior point
- higher order
- bayesian logistic regression
- learning algorithm
- tensor analysis
- linear programming
- semidefinite
- interior point methods
- image processing
- optimization problems
- pairwise
- optimization methods
- nonnegative matrix factorization
- convergence rate
- linear program
- sufficient conditions
- optimal solution