Results 31 to 40 of about 19,578 (192)
In this paper, we introduce a new iterative method that combines the inertial subgradient extragradient method and the modified Mann method for solving the pseudomonotone variational inequality problem and the fixed point of quasi-Bregman nonexpansive ...
Rose Maluleka +2 more
doaj +1 more source
New results on subgradient methods for strongly convex optimization problems with a unified analysis
We develop subgradient- and gradient-based methods for minimizing strongly convex functions under a notion which generalizes the standard Euclidean strong convexity.
Ito, Masaru
core +1 more source
``Efficient” Subgradient Methods for General Convex Optimization [PDF]
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified error of optimality.
openaire +3 more sources
A trust region method using subgradient for minimizing a nondifferentiable function [PDF]
The minimization of a particular nondifferentiable function is considered. The first and second order necessary conditions are given. A trust region method for minimization of this form of the objective function is presented.
Gardašević-Filipović Milanka
doaj +1 more source
Distributed optimization algorithm for multi-agent optimization problems using consensus control
The distributed optimization algorithms using consensus control are proposed for solving multi-agent optimization problems. The multi-agent optimization problem has discrete and continuous decision variables to minimize the sum of local cost functions ...
Tatsushi NISHI, Naoto DEBUCHI, Ziang LIU
doaj +1 more source
Subgradient Methods for Sharp Weakly Convex Functions [PDF]
16 pages, 3 ...
Damek Davis +3 more
openaire +3 more sources
Differential item functioning detection across multiple groups
Abstract Differential item functioning (DIF) can be investigated by estimating item response theory (IRT) parameters separately for different respondent groups, thus allowing for the detection of discrepancies in parameter estimates across groups. However, before comparing the estimates, it is necessary to convert them to a common metric due to the ...
Michela Battauz
wiley +1 more source
Distributed Optimization of Finite Condition Number for Laplacian Matrix in Multi‐Agent Systems
ABSTRACT This paper addresses the distributed optimization of the finite condition number of the Laplacian matrix in multi‐agent systems. The finite condition number, defined as the ratio of the largest to the second smallest eigenvalue of the Laplacian matrix, plays an important role in determining the convergence rate and performance of consensus ...
Yicheng Xu, Faryar Jabbari
wiley +1 more source
Max-Weight Revisited: Sequences of Non-Convex Optimisations Solving Convex Optimisations [PDF]
We investigate the connections between max-weight approaches and dual subgradient methods for convex optimisation. We find that strong connections exist and we establish a clean, unifying theoretical framework that includes both max-weight and dual ...
Leith, Douglas J., Valls, Víctor
core +1 more source
Cross-Layer Designs in Coded Wireless Fading Networks with Multicast
A cross-layer design along with an optimal resource allocation framework is formulated for wireless fading networks, where the nodes are allowed to perform network coding.
Gatsis, Nikolaos +2 more
core +1 more source

