An O(root(n)L) iteration bound primal-dual cone affine scaling algorithm for linear programming.
Jos F. SturmShuzhong ZhangPublished in: Math. Program. (1996)
Keyphrases
- affine scaling
- algorithm for linear programming
- primal dual
- line search
- infeasible interior point
- linear programming
- linear program
- approximation algorithms
- linear programming problems
- convex optimization
- interior point methods
- upper bound
- worst case
- convergence rate
- semidefinite programming
- variational inequalities
- lower bound
- simplex algorithm
- semidefinite
- interior point algorithm
- interior point
- objective function
- simplex method
- machine learning
- convex sets
- natural images
- image restoration
- convex optimization problems
- multiresolution
- pairwise