Primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric algebraic transformation.
Aicha KrariaBachir MerikhiDjamel BenterkiPublished in: CoRR (2024)
Keyphrases
- convex optimization
- primal dual
- interior point algorithm
- variational inequalities
- interior point methods
- linear programming problems
- convex optimization problems
- semidefinite programming
- low rank
- interior point
- convex sets
- convex relaxation
- linear programming
- total variation
- linear constraints
- simplex method
- convergence rate
- linear program
- image denoising
- convex constraints
- object recognition