Results 41 to 50 of about 19,030 (190)

Differential item functioning detection across multiple groups

British Journal of Mathematical and Statistical Psychology, EarlyView.
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

Game‐based distributed energy‐sharing model for prosumers in microgrids considering carbon emissions and its fast equilibrium‐finding method

Energy Science & Engineering
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

Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization

Algorithms
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   +1 more source

Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities

Journal of Inequalities and Applications, 2020
In this paper, we introduce Bregman subgradient extragradient methods for solving variational inequalities with a pseudo-monotone operator which are not necessarily Lipschitz continuous.
Lateef Olakunle Jolaoso, Maggie Aphane
doaj   +1 more source

Max-Weight Revisited: Sequences of Non-Convex Optimisations Solving Convex Optimisations [PDF]

, 2014
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

Distributed Optimization of Finite Condition Number for Laplacian Matrix in Multi‐Agent Systems

International Journal of Robust and Nonlinear Control, Volume 36, Issue 9, Page 5030-5043, June 2026.
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

A Distributed Newton Method for Network Utility Maximization

, 2010
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of convergence properties.
Jadbabaie, Ali, Ozdaglar, Asuman, Wei, Ermin   +2 more
core   +3 more sources

On Bounds for Norms of Reparameterized ReLU Artificial Neural Network Parameters: Sums of Fractional Powers of the Lipschitz Norm Control the Network Parameter Vector

Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2135-2160, 15 March 2026.
ABSTRACT It is an elementary fact in the scientific literature that the Lipschitz norm of the realization function of a feedforward fully connected rectified linear unit (ReLU) artificial neural network (ANN) can, up to a multiplicative constant, be bounded from above by sums of powers of the norm of the ANN parameter vector.
Arnulf Jentzen, Timo Kröger
wiley   +1 more source

On Mann implicit composite subgradient extragradient methods for general systems of variational inequalities with hierarchical variational inequality constraints

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, Jen-Chih Yao, Yekini Shehu   +2 more
doaj   +1 more source

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, Drusvyatskiy, Dmitriy, Kakade, Sham, Lee, Jason D.   +3 more
openaire   +3 more sources