An interior-point method for fractional programs with convex constraints.
Roland W. FreundFlorian JarrePublished in: Math. Program. (1994)
Keyphrases
- convex constraints
- interior point methods
- convex optimization
- convex programming
- primal dual
- linear program
- linear programming
- semidefinite programming
- low rank
- convergence rate
- total variation
- solving problems
- quadratic programming
- quadratic program
- computationally intensive
- np hard
- special case
- high order
- bayesian networks
- sufficient conditions
- convex sets
- denoising
- upper bound
- global consistency