A new accelerated algorithm with a linesearch technique for convex bilevel optimization problems with applications

We considered a convex bilevel optimization problem when the outer level problem was to find a minimizer of a strongly convex function over the set of solutions of the inner level problem which was in the form of minimization of the sum of a convex differentiable function and a nonsmooth convex func...

Full description

Bibliographic Details
Main Authors: Adisak Hanjing, Panadda Thongpaen, Suthep Suantai
Format: Article
Language:English
Published: AIMS Press 2024-07-01
Series:AIMS Mathematics
Subjects:
Online Access:https://www.aimspress.com/article/doi/10.3934/math.20241088?viewType=HTML