Hessian distances and their applications in the complexity analysis of interior-point methods.
Yurii E. NesterovYu XiaPublished in: Optim. Methods Softw. (2013)
Keyphrases
- complexity analysis
- interior point methods
- convex optimization
- linear program
- linear programming
- primal dual
- semidefinite programming
- interior point
- theoretical analysis
- quadratic programming
- lower bound
- solving problems
- distance measure
- euclidean distance
- first order logic
- cutting plane method
- distance function
- computationally intensive
- computational complexity
- semidefinite
- linear systems
- low rank
- upper bound
- sufficient conditions
- markov random field
- knowledge representation
- dynamic programming
- image processing
- quadratically constrained quadratic