Extension of a projective interior point method for linearly constrained convex programming.
Zakia KebbicheAbdelkrim KeraghelAdnan YassinePublished in: Appl. Math. Comput. (2007)
Keyphrases
- convex programming
- interior point methods
- linearly constrained
- convex optimization
- primal dual
- variational inequalities
- linear programming
- linear program
- semidefinite programming
- linear constraints
- quadratic programming
- computationally intensive
- solving problems
- linear systems
- convergence rate
- low rank
- objective function
- semi supervised