On some steplength approaches for proximal algorithms
Applied Mathematics and Computation, pp. 345-362, 2015.
We discuss a number of novel steplength selection schemes for proximal-based convex optimization algorithms. In particular, we consider the problem where the Lipschitz constant of the gradient of the smooth part of the objective function is unknown. We generalize two optimization algorithms of Khobotov type and prove convergence. We also ...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)