Results 21 to 30 of about 4,553,166 (289)
Weighted arithmetic–geometric operator mean inequalities
In this paper, we refine and generalize some weighted arithmetic–geometric operator mean inequalities due to Lin (Stud. Math. 215:187–194, 2013) and Zhang (Banach J. Math. Anal. 9:166–172, 2015) as follows: Let A and B be positive operators.
Jianming Xue
doaj +1 more source
On the Lawson–Lim means and Karcher mean for positive invertible operators
This note aims to generalize the reverse weighted arithmetic–geometric mean inequality of n positive invertible operators due to Lawson and Lim. In addition, we make comparisons between the weighted Karcher mean and Lawson–Lim geometric mean for higher ...
Wenshi Liao +3 more
doaj +1 more source
The search algorithm based on symbiotic organisms’ interactions is a relatively recent bio-inspired algorithm of the swarm intelligence field for solving numerical optimization problems. It is meant to optimize applications based on the simulation of the
Ajoze Abdulraheem Zubair +7 more
doaj +1 more source
Diffusion means in geometric spaces [PDF]
We introduce a location statistic for distributions on non-linear geometric spaces, the diffusion mean, serving as an extension and an alternative to the Fréchet mean. The diffusion mean arises as the generalization of Gaussian maximum likelihood analysis to non-linear spaces by maximizing the likelihood of a Brownian motion. The diffusion mean depends
Eltzner, Benjamin +3 more
openaire +5 more sources
A Geometric Approach to $k$-means
\kmeans clustering is a fundamental problem in many scientific and engineering domains. The optimization problem associated with \kmeans clustering is nonconvex, for which standard algorithms are only guaranteed to find a local optimum. Leveraging the hidden structure of local solutions, we propose a general algorithmic framework for escaping ...
Jiazhen Hong +3 more
openaire +3 more sources
Neutrosophic Goal Geometric Programming Problem based on Geometric Mean Method and its Application [PDF]
This paper describes neutrosophic goal geometric programming method, a new concept to solve multi-objective non-linear optimization problem under uncertainty.
Sahidul Islam, Tanmay Kundu
doaj +1 more source
Consensus Driven by the Geometric Mean [PDF]
Consensus networks are usually understood as arithmetic mean driven dynamical averaging systems. In applications, however, network dynamics often describe inherently non-arithmetic and non-linear consensus processes. In this paper, we propose and study three novel consensus protocols driven by geometric mean averaging: a polynomial, an entropic, and a ...
Herbert Mangesius +2 more
openaire +2 more sources
Comparing Different Specifications of Mean–Geometric Mean Linking
Mean–geometric mean (MGM) linking compares group differences on a latent variable θ within the two-parameter logistic (2PL) item response theory model.
Alexander Robitzsch
doaj +1 more source
Optimal Power Mean Bounds for the Weighted Geometric Mean of Classical Means
For , the power mean of order of two positive numbers and is defined by , for , and , for . In this paper, we answer the question: what are the greatest value and the least value such that the double inequality holds for all and ...
Chu Yu-Ming, Long Bo-Yong
doaj +2 more sources
Geometry and inequalities of geometric mean [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dinh, Trung Hoa +2 more
openaire +2 more sources

