2020
DOI: 10.3390/mca25040066
|View full text |Cite
|
Sign up to set email alerts
|

Proximal Gradient Method for Solving Bilevel Optimization Problems

Abstract: In this paper, we consider a bilevel optimization problem as a task of finding the optimum of the upper-level problem subject to the solution set of the split feasibility problem of fixed point problems and optimization problems. Based on proximal and gradient methods, we propose a strongly convergent iterative algorithm with an inertia effect solving the bilevel optimization problem under our consideration. Furthermore, we present a numerical example of our algorithm to illustrate its applicability.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…However, bi-level model's complexity makes it difficult to be solved in practice using the conventional approaches and computing devices. Specially, they may fail in the face of large-scale, highdimensional applications, especially in machine learning and computer vision fields [48], [49].…”
Section: Introductionmentioning
confidence: 99%
“…However, bi-level model's complexity makes it difficult to be solved in practice using the conventional approaches and computing devices. Specially, they may fail in the face of large-scale, highdimensional applications, especially in machine learning and computer vision fields [48], [49].…”
Section: Introductionmentioning
confidence: 99%