Login / Signup

A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems.

Radu Ioan BotChristopher Hendrich
Published in: Comput. Optim. Appl. (2013)
Keyphrases
  • convex optimization problems
  • convex optimization
  • optimization problems
  • learning problems
  • structured sparsity
  • primal dual
  • interior point methods
  • data sets
  • feature vectors