An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems.
Radu Ioan BotErnö Robert CsetnekPublished in: Numer. Algorithms (2016)
Keyphrases
- primal dual
- forward backward
- linear programming problems
- linear programming
- interior point algorithm
- convergence rate
- semidefinite programming
- combinatorial optimization
- linear program
- simplex algorithm
- dynamic programming
- infeasible interior point
- interior point
- convex programming
- dual formulation
- simplex method
- interior point methods
- learning algorithm
- solving problems
- randomly generated
- convex optimization
- quadratic programming
- approximation algorithms
- convex optimization problems
- upper bound
- variational inequalities
- convex functions
- convex hull
- np complete
- optimization problems
- convex constraints
- computational complexity
- objective function