A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems.
Paul ArmandJean Charles GilbertSophie Jan-JégouPublished in: SIAM J. Optim. (2000)
Keyphrases
- minimization problems
- interior point algorithm
- interior point
- linear programming
- primal dual
- interior point methods
- convex optimization
- total variation
- convergence rate
- feasible solution
- simplex method
- low rank
- linear program
- linear programming problems
- multicriteria optimization
- image restoration
- cutting plane
- dynamic programming
- denoising
- upper bound
- mumford shah
- np hard
- semidefinite programming
- convex sets
- image denoising
- integer program
- convex functions
- quadratic programming
- mixed integer
- optimal solution
- column generation
- quasiconvex
- dimensionality reduction