Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form.
Levent TunçelPublished in: Found. Comput. Math. (2001)
Keyphrases
- interior point methods
- primal dual
- convex optimization problems
- convex optimization
- linear programming
- linear program
- interior point
- linear programming problems
- convex programming
- interior point algorithm
- semidefinite programming
- approximation algorithms
- convergence rate
- simplex algorithm
- computationally intensive
- semidefinite
- quadratic programming
- genetic algorithm
- linear systems
- support vector
- solving problems
- low rank
- image restoration