Proximal Gradient Method for Solving Bilevel Optimization Problems
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 converge...
Main Authors: | Seifu Endris Yimer, Poom Kumam, Anteneh Getachew Gebrie |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-10-01
|
Series: | Mathematical and Computational Applications |
Subjects: | |
Online Access: | https://www.mdpi.com/2297-8747/25/4/66 |
Similar Items
-
Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints
by: Seifu Endris Yimer, et al.
Published: (2019-09-01) -
Extragradient subgradient methods for solving bilevel equilibrium problems
by: Tadchai Yuying, et al.
Published: (2018-11-01) -
Hybrid projected subgradient-proximal algorithms for solving split equilibrium problems and split common fixed point problems of nonexpansive mappings in Hilbert spaces
by: Anteneh Getachew Gebrie, et al.
Published: (2018-02-01) -
Multi-Sine Cosine Algorithm for Solving Nonlinear Bilevel Programming Problems
by: Yousria Abo-Elnaga, et al.
Published: (2020-04-01) -
A Fixed-Point Subgradient Splitting Method for Solving Constrained Convex Optimization Problems
by: Nimit Nimana
Published: (2020-03-01)