Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier.
Petra Renáta RigóZsolt DarvayPublished in: Comput. Optim. Appl. (2018)
Keyphrases
- interior point methods
- convex programming
- quadratic programming
- convex optimization
- semidefinite
- primal dual
- semidefinite programming
- linear programming
- inequality constraints
- optimization problems
- linear program
- convex optimization problems
- constrained optimization
- coefficient matrix
- worst case
- computationally intensive
- solving problems
- machine learning
- least squares
- support vector machine
- high resolution