Results 31 to 40 of about 22,536 (196)
Incremental Stochastic Subgradient Algorithms for Convex Optimization [PDF]
In this paper we study the effect of stochastic errors on two constrained incremental sub-gradient algorithms. We view the incremental sub-gradient algorithms as decentralized network optimization algorithms as applied to minimize a sum of functions ...
Nedich, A +2 more
core +2 more sources
A Refined Inertial-like Subgradient Method for Split Equality Problems
This paper presents the convergence analysis of a newly proposed algorithm for approximating solutions to split equality variational inequality and fixed point problems in real Hilbert spaces.
Khushdil Ahmad +2 more
doaj +1 more source
Low-Complexity LP Decoding of Nonbinary Linear Codes [PDF]
Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes.
Mark F. Flanagan +5 more
core +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
The results in this manuscript has been incorporated to another ...
Nam, Nguyen Mau +2 more
openaire +2 more sources
Riemannian Median and Its Estimation
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness.
Yang, Le
core +1 more source
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

