Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming.
Jacek GondzioPublished in: SIAM J. Optim. (2013)
Keyphrases
- convergence analysis
- interior point methods
- convex quadratic programming
- primal dual
- variational inequalities
- convex optimization
- optimality conditions
- convergence rate
- nonlinear programming
- linear programming
- linear program
- global convergence
- semidefinite programming
- newton method
- computationally intensive
- quadratic programming
- solving problems
- evolutionary algorithm
- approximation methods
- approximation algorithms
- linear systems
- denoising
- computational complexity
- dynamic programming
- total variation