Results 191 to 200 of about 4,101,445 (240)
Some of the next articles are maybe not open access.

Bounded Error Estimation: A Chebyshev Center Approach

2007 2nd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2007
We develop a nonlinear minimax estimator for the classical linear regression model assuming that the true parameter vector lies in an intersection of ellipsoids. We seek an estimate that minimizes the worst-case estimation error over the given parameter set.
Yonina C. Eldar   +2 more
openaire   +2 more sources

On Chebyshev Center of the Intersection of Two Ellipsoids

World Congress on Global Optimization, 2019
We study the problem of finding the smallest ball covering the intersection of two ellipsoids, which is also known as the Chebyshev center problem (CC). Semidefinite programming (SDP) relaxation is an efficient approach to approximate (CC). In this paper, we first establish the worst-case approximation bound of (SDP).
Xiaoli Cen   +3 more
openaire   +2 more sources

The Chebyshev center: A multidimensional estimate of location

Journal of Statistical Planning and Inference, 1986
In this paper the center of the smallest k-dimensional sphere enclosing a data set, hereinafter called the Chebyshev center, is introduced as a multidimensional measure of location. The distribution of this estimator, which is a multidimensional generalization of the univariate midrange, is derived in the general case and its properties investigated ...
E. J. Halteman
openaire   +3 more sources

Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks

Optimization, 2022
This article deals with the inverse obnoxious center location problem on general networks in which the edge lengths are modified at the minimum overall cost with respect to given modification bounds such that a predetermined facility point becomes an ...
Mehran Hasanzadeh   +2 more
semanticscholar   +1 more source

Chebyshev Center Computation on Probability Simplex With $\alpha$-Divergence Measure

IEEE Signal Processing Letters, 2020
Chebyshev center computation problem, i.e. finding the point which is at minimum distance to a set of given points, on the probability simplex with $\alpha$-divergence distance measure is studied. The proposed solution generalizes the Arimoto-Blahut (AB)
Ç. Candan
semanticscholar   +1 more source

Significant reduction in the duration of transient voltage responses of a plasmonic nanopore sensor by use of a Chebyshev filter

BiOS, 2023
We present the effects of a Chebyshev filter circuit on the transient electrical current responses of a plasmonic nanopore sensor during abrupt voltage reversals.
H. Asadzadeh   +4 more
semanticscholar   +1 more source

Strong uniqueness and alternation theorems for relative Chebyshev centers

Journal of Approximation Theory, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Levis, Fabián Eduardo   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy