In this paper we study convex bilevel optimization problems for which the inner level consists of minimization of the sum of smooth and nonsmooth functions. The outer level aims at minimizing a smooth and strongly convex function over the optimal solutions set of the inner problem. We analyze a first order method which is based on an existing fixed-point algorithm. Global sublinear rate of convergence of the method is established in terms of the inner objective function values.
No takes yet. Share an insight, caveat, or question.
Sabach et al. (2017) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: