On the convergence of primal-dual interior-point methods with wide neighborhoods.
Levent TunçelPublished in: Comput. Optim. Appl. (1995)
Keyphrases
- interior point methods
- primal dual
- convergence rate
- convex optimization
- linear programming
- interior point
- convex programming
- linear programming problems
- linear program
- semidefinite programming
- interior point algorithm
- variational inequalities
- approximation algorithms
- simplex method
- algorithm for linear programming
- simplex algorithm
- semidefinite
- analytic center
- computationally intensive
- convex optimization problems
- convex functions
- quadratic programming
- image restoration
- super resolution
- image processing
- learning algorithm