Proximal methods for minimizing the sum of a convex function and a composite function

2011/05/02 by Quoc Tran Dinh, Moritz Diehl, Dinh, Quoc Tran +1
Engineering · Mathematics · Computer Science · #Sparse and Compressive Sensing Techniques #Advanced Optimization Algorithms Research #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1105.0276

Abstract

This paper extends the algorithm schemes proposed in \citeNesterov2007a and \citeNesterov2007b to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and their global convergence is investigated. The worst case complexity bound is also estimated under certain Lipschitz conditions and nondegeneratedness. The algorithm is then accelerated to get a faster convergence rate for the strongly convex case.

Related

• A proximal method for composite minimization
• Inexact proximal ε-subgradient methods for composite convex optimization problems
• Proximal Newton-type methods for minimizing composite functions
• Incremental proximal gradient scheme with penalization for constrained\n composite convex optimization problems
• Exact worst-case convergence rates of the proximal gradient method for composite convex minimization