Efficient regularized Newton-type algorithm for solving convex optimization problem.
Shazia JavedAreeba KhanPublished in: J. Appl. Math. Comput. (2022)
Keyphrases
- convex optimization
- primal dual
- objective function
- learning algorithm
- interior point methods
- computational complexity
- low rank
- convex formulation
- augmented lagrangian
- linear programming problems
- dynamic programming
- computationally intensive
- quadratic programming
- total variation
- linear programming
- quadratic program
- trace norm
- np hard