A primal-dual interior-point method based on various selections of displacement step for symmetric optimization.
Baha AlzalgPublished in: Comput. Optim. Appl. (2019)
Keyphrases
- primal dual
- interior point methods
- convex programming
- linear programming
- convex optimization
- linear program
- quadratic programming
- convex optimization problems
- semidefinite programming
- linear programming problems
- semidefinite
- interior point algorithm
- approximation algorithms
- convergence rate
- interior point
- variational inequalities
- nonlinear programming
- algorithm for linear programming
- inequality constraints
- analytic center
- optimization problems
- simplex method
- convex functions
- computationally intensive
- solving problems
- np hard
- quasiconvex
- constrained optimization