Distributed primal-dual interior-point methods for solving tree-structured coupled convex problems using message-passing.
Sina Khoshfetrat PakazadAnders HanssonMartin S. AndersenIsak NielsenPublished in: Optim. Methods Softw. (2017)
Keyphrases
- interior point methods
- convex programming
- primal dual
- convex optimization problems
- message passing
- convex optimization
- linear programming problems
- interior point
- linear programming
- semidefinite programming
- interior point algorithm
- distributed systems
- solving problems
- linear program
- semidefinite
- quadratic programming
- simplex algorithm
- simplex method
- convergence rate
- belief propagation
- lp relaxation
- analytic center
- approximation algorithms
- variational inequalities
- convex functions
- convex relaxation
- quadratic program
- linear systems
- low rank
- markov random field
- optimal solution
- higher order
- convex sets
- computationally intensive
- total variation
- graphical models
- least squares