Results 11 to 20 of about 19,578 (192)
Stochastic Subgradient Method Converges on Tame Functions [PDF]
Foundations of Computational Mathematics, 2019 This work considers the question: what convergence guarantees does the stochastic subgradient method have in the absence of smoothness and convexity? We prove that the stochastic subgradient method, on any semialgebraic locally Lipschitz function, produces limit points that are all first-order stationary.
Davis, Damek +3 more
openaire +5 more sources
Fixed point quasiconvex subgradient method [PDF]
European Journal of Operational Research, 2020 Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional objective functions, is an important instance.
Kazuhiro Hishinuma, Hideaki Iiduka
openaire +2 more sources
Analysis of Subgradient Extragradient Iterative Schemes for Variational Inequalities
Journal of Mathematics, 2021 In this paper, we investigate the monotone variational inequality in Hilbert spaces. Based on Censor’s subgradient extragradient method, we propose two modified subgradient extragradient algorithms with self-adaptive and inertial techniques for finding ...
Danfeng Wu +3 more
doaj +1 more source
Journal of Inequalities and Applications, 2021 For the purpose of this article, we introduce a modified form of a generalized system of variational inclusions, called the generalized system of modified variational inclusion problems (GSMVIP).
Araya Kheawborisut, Atid Kangtunyakarn
doaj +1 more source
Mathematics, 2020 The projected subgradient algorithms can be considered as an improvement of the projected algorithms and the subgradient algorithms for the equilibrium problems of the class of monotone and Lipschitz continuous operators.
Yonghong Yao +2 more
doaj +1 more source
On Subgradient Methods with Polyak’s Step and Space Transformation
Кібернетика та комп'ютерні технології, 2022 Introduction. Minimization of ravine convex functions, both smooth and non-smooth, arises in many problems of planning, control, stability analysis of dynamic systems, artificial intelligence, and machine learning.
Viktor Stovba, Oleksandr Zhmud
doaj +1 more source
IEEE Access, 2021 The lifetime of the submodules (SMs) in a modular multilevel converter (MMC) is significantly impacted by its switching frequency. In this work, the determination of the switching frequency, to be applied to the nearest level modulation (NLM) method used
Yonghui Li +3 more
doaj +1 more source
Scaling Techniques for $\epsilon$-Subgradient Methods [PDF]
SIAM Journal on Optimization, 2016 Summary: 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 attractive for a variety of relevant applications.
BONETTINI, Silvia +2 more
openaire +2 more sources
On Robustness of the Normalized Subgradient Method with Randomly Corrupted Subgradients [PDF]
2021 American Control Conference (ACC), 2021 Numerous modern optimization and machine learning algorithms rely on subgradient information being trustworthy and hence, they may fail to converge when such information is corrupted. In this paper, we consider the setting where subgradient information may be arbitrarily corrupted (with a given probability) and study the robustness properties of the ...
Turan, Berkay +3 more
openaire +2 more sources
Journal of Inequalities and Applications, 2022 In a real Hilbert space, let the VIP, GSVI, HVI, and CFPP denote a variational inequality problem, a general system of variational inequalities, a hierarchical variational inequality, and a common fixed-point problem of a countable family of uniformly ...
Lu-Chuan Ceng +2 more
doaj +1 more source