Primal Interior-Point Method for Large Sparse Minimax Optimization.
Ladislav LuksanCtirad MatonohaJan VlcekPublished in: Kybernetika (2009)
Keyphrases
- interior point methods
- primal dual
- linear program
- linear programming
- convex programming
- coefficient matrix
- quadratic programming
- convex optimization
- convex optimization problems
- semidefinite programming
- interior point algorithm
- linear programming problems
- semidefinite
- preconditioned conjugate gradient method
- optimization problems
- approximation algorithms
- constrained optimization
- simplex method
- column generation
- super resolution
- nonlinear programming
- least squares
- inequality constraints
- np hard
- high dimensional
- optimal solution
- reinforcement learning