A Fixed-Point Subgradient Splitting Method for Solving Constrained Convex Optimization Problems
In this work, we consider a bilevel optimization problem consisting of the minimizing sum of two convex functions in which one of them is a composition of a convex function and a nonzero linear transformation subject to the set of all feasible points represented in the form of common fixed-point set...
Main Author: | Nimit Nimana |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-03-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/12/3/377 |
Similar Items
-
Projected Subgradient Algorithms for Pseudomonotone Equilibrium Problems and Fixed Points of Pseudocontractive Operators
by: Yonghong Yao, et al.
Published: (2020-03-01) -
Extragradient subgradient methods for solving bilevel equilibrium problems
by: Tadchai Yuying, et al.
Published: (2018-11-01) -
String-averaging incremental subgradient methods for constrained convex optimization problems
by: Rafael Massambone de Oliveira
Published: (2017) -
String-averaging incremental subgradient methods for constrained convex optimization problems
by: Oliveira, Rafael Massambone de
Published: (2017) -
Composite inertial subgradient extragradient methods for variational inequalities and fixed point problems
by: Lu-Chuan Ceng, et al.
Published: (2019-10-01)