Primal-dual proximal point algorithm for linearly constrained convex programming problems.
Satoru IbarakiMasao FukushimaToshihide IbarakiPublished in: Comput. Optim. Appl. (1992)
Keyphrases
- convex programming
- primal dual
- interior point methods
- variational inequalities
- linear programming
- convex optimization
- linearly constrained
- semidefinite programming
- linear program
- convex functions
- basis pursuit
- convex constraints
- approximation algorithms
- algorithm for linear programming
- quadratic programming
- solving problems
- objective function
- computationally intensive
- convergence rate
- training samples
- feature space
- image segmentation