Poster
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem
Huaqing Zhang · Lesi Chen · Jing Xu · Jingzhao Zhang
West Ballroom A-D #6002
[
Abstract
]
Wed 11 Dec 11 a.m. PST
— 2 p.m. PST
Abstract:
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the approximate optimal value of such problems is not obtainable by first-order zero-respecting algorithms. Then we follow recent works to pursue the weak approximate solutions. For this goal, we propose novel near-optimal methods for smooth and nonsmooth problems by reformulating them into functionally constrained problems.
Live content is unavailable. Log in and register to view live content