A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods.
Liying LiuShaoyong LiPublished in: J. Comput. Appl. Math. (2011)
Keyphrases
- interior point methods
- primal dual
- linear programming
- linear program
- convex optimization
- interior point
- convex programming
- linear programming problems
- semidefinite programming
- duality gap
- approximation algorithms
- interior point algorithm
- quadratic programming
- convergence rate
- analytic center
- simplex algorithm
- variational inequalities
- convex functions
- solving problems
- upper bound
- extreme points
- computationally intensive
- objective function
- semidefinite
- simplex method
- np hard
- convex optimization problems
- optimal solution
- lower bound
- denoising
- higher order