An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization.
Zaoui BillelDjamel BenterkiAdnan YassinePublished in: J. Appl. Math. Comput. (2024)
Keyphrases
- semidefinite
- interior point algorithm
- interior point methods
- primal dual
- inequality constraints
- semidefinite programming
- linear programming
- convex optimization
- linear program
- nonlinear programming
- approximation algorithms
- convex relaxation
- quadratic programming
- convergence rate
- variational inequalities
- simplex method
- solving problems
- evolutionary algorithm
- computationally intensive
- quadratic program
- optimization problems