vix.ing · top · new · best · stats

A First Order Method for Solving Convex Bi-Level Optimization Problems

2017/02/13 by Shoham Sabach, Sabach, Shoham, Shimrit Shtern +1 · 30 citations
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis #Sparse and Compressive Sensing Techniques #math.OC

paper · pdf · doi:10.48550/arxiv.1702.03999

arxiv created 2017/02/13 · openalex publication_date 2017/02/13 · arxiv updated 2017/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we study convex bi-level 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.

Cited by

Related