Results 21 to 30 of about 1,615 (176)
In this paper, we introduce an inertial parallel CQ subgradient extragradient method for finding a common solutions of variational inequality problems.
Ponkamon Kitisak, Watcharaporn Cholamjiak, Damrongsak Yambangwai
doaj +1 more source
One-Rank Linear Transformations and Fejer-Type Methods: An Overview
Subgradient methods are frequently used for optimization problems. However, subgradient techniques are characterized by slow convergence for minimizing ravine convex functions.
Volodymyr Semenov +3 more
doaj +1 more source
Bounded perturbation resilience of extragradient-type methods and their applications
In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces.
Q-L Dong, A Gibali, D Jiang, Y Tang
doaj +1 more source
We propose two new iterative algorithms for solving K-pseudomonotone variational inequality problems in the framework of real Hilbert spaces. These newly proposed methods are obtained by combining the viscosity approximation algorithm, the Picard Mann ...
Godwin Amechi Okeke +2 more
doaj +1 more source
Subgradient and bundle methods for nonsmooth optimization
The nonsmooth optimization methods can mainly be divided into two groups: subgradient and bundle methods. Usually, when developing new algorithms and testing them, the comparison is made between similar kinds of methods.
Napsu Karmitsa +5 more
core +1 more source
The primary objective of this study is to introduce two novel extragradient-type iterative schemes for solving variational inequality problems in a real Hilbert space.
Chainarong Khunpanuk +2 more
doaj +1 more source
Scaling techniques for $epsilon$-subgradient methods [PDF]
The recent literature on first order methods for smooth optimization shows that significant improvements on the practical convergence behavior can be achieved with variable step size and scaling for the gradient, making this class of algorithms ...
Benfenati, A. +5 more
core +1 more source
In this paper, we introduce and investigate composite inertial gradient-based algorithms with a line-search process for solving a variational inequality problem (VIP) with a pseudomonotone and Lipschitz continuous mapping and a common fixed-point problem
Lu-Chuan Ceng, Qing Yuan
doaj +1 more source
A Quantised Push‐Sum Distributed Adaptive Momentum Algorithm for Optimisation Over Directed Networks
ABSTRACT In this paper, we investigate a distributed constrained optimisation problem over directed networks. The agents in the networks conduct local computations and communications, endeavouring to collaboratively minimise the aggregation of all locally known convex cost functions subject to a global constraint set.
Qingguo Lü +6 more
wiley +1 more source
In recent years, energy sharing has attracted a lot of attention. However, the intermediate platforms in centralized energy‐sharing methods cause the rapid growth of communication complexity and the risk of privacy leakage.
Xinze Zheng, Qiang Li, Juzhong Yuan
doaj +1 more source

