MARATTO

article · Mathematical and Computational Applications

Proximal Gradient Method for Solving Bilevel Optimization Problems

20202 citationsOpen accessDebre Berhan University

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.

Research topics

  • Optimization and Variational Analysis
  • Advanced Optimization Algorithms Research
  • Fixed Point Theorems Analysis

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.3390/mca25040066

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.