A low-computation-complexity, energy-efficient, and high-performance linear program solver based on primal-dual interior point method using memristor crossbars.
Ruizhe CaiAo RenSucheta SoundarajanYanzhi WangPublished in: Nano Commun. Networks (2018)
Keyphrases
- linear program
- primal dual
- energy efficient
- interior point methods
- linear programming
- wireless sensor networks
- energy consumption
- interior point algorithm
- convex programming
- linear programming problems
- variational inequalities
- interior point
- convex optimization
- simplex method
- simplex algorithm
- semidefinite programming
- inequality constraints
- optimal solution
- objective function
- mixed integer
- dynamic programming
- column generation
- algorithm for linear programming
- computational complexity
- np hard
- integer program
- convex functions
- valid inequalities
- semidefinite
- worst case
- extreme points
- convex optimization problems
- solving problems
- approximation algorithms
- convergence rate
- lower bound