An infeasible-interior-point algorithm using projections onto a convex set.
Shinji MizunoFlorian JarrePublished in: Ann. Oper. Res. (1996)
Keyphrases
- convex sets
- interior point algorithm
- convex optimization
- interior point methods
- primal dual
- multicriteria optimization
- linear programming
- quasiconvex
- horizontal and vertical projections
- discrete sets
- discrete tomography
- finite number
- convex hull
- higher dimensional
- convex functions
- simplex method
- linear program
- low rank
- objective function
- special case
- quadratic programming
- semidefinite programming
- computationally intensive
- total variation
- convergence rate