Incremental Delayed Subgradient Method for Decentralized Nonsmooth Convex–Concave Minimax Optimization

Incremental Delayed Subgradient Method for Decentralized Nonsmooth Convex–Concave Minimax Optimization

In this paper, we propose an incremental-type subgradient scheme for solving a nonsmooth convex–concave minimax optimization problem in the setting of Euclidean spaces. We investigate convergence results by deriving an upper bound for the absolute value of the difference between the function value o...

Full description

Saved in:
Bibliographic Details
Main Authors: Thipagon Feesantia, Tipsuda Arunrat, Nimit Nimana
Format: Article
Language:English
Published: MDPI AG 2025-02-01
Series:Algorithms
Subjects:
delay
incremental method
minimax problem
saddle point
subgradient method
Online Access:https://www.mdpi.com/1999-4893/18/3/126
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/1999-4893/18/3/126

Similar Items