Results 11 to 20 of about 1,615 (176)
Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization
In this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods.
Ontima Pankoon, Nimit Nimana
doaj +2 more sources
Primal Subgradient Methods with Predefined Step Sizes. [PDF]
In this paper, we suggest a new framework for analyzing primal subgradient methods for nonsmooth convex optimization problems. We show that the classical step-size rules, based on normalization of subgradient, or on knowledge of the optimal value of the ...
Nesterov Y.
europepmc +2 more sources
On the Problem of Planning of Multi-Product Flows and Modernization of the Transportation Network
Introduction. The problems of optimal planning of multi-product flows on transportation networks have a variety of important practical applications (transportation, logistics, communication networks). The mathematical models of these problems, as a rule,
Nikolay Zhurbenko, Boris Chumakov
doaj +1 more source
Subgradient Descent Learning Over Fading Multiple Access Channels With Over-the-Air Computation
We focus on a distributed learning problem in a communication network, consisting of $N$ distributed nodes and a central parameter server (PS). The PS is responsible for performing the computation based on data received from the nodes, which are ...
Tamir L. S. Gez, Kobi Cohen
doaj +1 more source
Relaxation Subgradient Algorithms with Machine Learning Procedures
In the modern digital economy, optimal decision support systems, as well as machine learning systems, are becoming an integral part of production processes.
Vladimir Krutikov +4 more
doaj +1 more source
Distributed Asymptotic Minimization of Sequences of Convex Functions by a Broadcast Adaptive Subgradient Method [PDF]
We propose a non-hierarchical decentralized algorithm for the asymptotic minimization of possibly time-varying convex functions. In our method, each agent in a network has a private, local (possibly time-varying) cost function, and the objective is to ...
Renato L. G. Cavalcante +11 more
core +1 more source
In this paper, we design two inertial-type subgradient extragradient algorithms with the linear-search process for resolving the two pseudomonotone variational inequality problems (VIPs) of and the common fixed point problem (CFPP) of finite Bregman ...
Cong-Shan Wang +5 more
doaj +1 more source
A Novel Lagrangian Multiplier Update Algorithm for Short-Term Hydro-Thermal Coordination
The backbone of a conventional electrical power generation system relies on hydro-thermal coordination. Due to its intrinsic complex, large-scale and constrained nature, the feasibility of a direct approach is reduced.
P. M. R. Bento +3 more
doaj +1 more source
In a real Hilbert space, we aim to investigate two modified Mann subgradient-like methods to find a solution to pseudo-monotone variational inequalities, which is also a common fixed point of a finite family of nonexpansive mappings and an asymptotically
Lu-Chuan Ceng +2 more
doaj +1 more source
The primary goal of this research is to investigate the approximate numerical solution of variational inequalities using quasimonotone operators in infinite-dimensional real Hilbert spaces.
Rehman Habib ur +4 more
doaj +1 more source

