A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting.
Francisco J. Aragón ArtachoRadu Ioan BotDavid Torregrosa-BelénPublished in: Numer. Algorithms (2023)
Keyphrases
- primal dual
- linear programming
- dynamic programming
- worst case
- linear program
- linear programming problems
- convergence rate
- semidefinite programming
- randomly generated
- affine scaling
- simplex algorithm
- simplex method
- objective function
- np hard
- computational complexity
- approximation algorithms
- interior point algorithm
- variational inequalities
- convex optimization
- interior point
- dual formulation
- optimal solution