A self-adjusting primal-dual interior point method for linear programs.
Shaohua PanXiangsi LiPublished in: Optim. Methods Softw. (2004)
Keyphrases
- linear program
- primal dual
- interior point methods
- linear programming
- linear programming problems
- interior point algorithm
- interior point
- convex programming
- inequality constraints
- simplex algorithm
- simplex method
- semidefinite programming
- column generation
- variational inequalities
- algorithm for linear programming
- optimal solution
- objective function
- integer program
- semidefinite
- dynamic programming
- extreme points
- mixed integer
- convex functions
- convex optimization problems
- np hard
- multi objective
- feasible solution
- analytic center
- convex optimization
- special case
- quadratic programming
- denoising
- reinforcement learning