On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods.
María D. González-LimaRichard A. TapiaFlorian A. PotraPublished in: SIAM J. Optim. (1998)
Keyphrases
- analytic center
- primal dual
- interior point methods
- cutting plane method
- linear programming
- convex optimization
- linear programming problems
- linear program
- interior point algorithm
- semidefinite programming
- convergence rate
- interior point
- semidefinite
- convex programming
- variational inequalities
- extreme points
- quadratic programming
- approximation algorithms
- computationally intensive
- simplex method
- feasible set
- linear programming relaxation
- linear systems
- hypothesis space
- objective function