✦ LIBER ✦

Subspaces of ℓ1with strictly convex norm

✍ Scribed by M. I. Kadets; V. P. Fonf

Publisher: SP MAIK Nauka/Interperiodica
Year: 1983
Tongue: English
Weight: 210 KB
Volume: 33
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01686329

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A proof of Sudakov theorem with strictly

A proof of Sudakov theorem with strictly convex norms

✍ Laura Caravenna 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 French ⚖ 568 KB

Norm-one projections onto subspaces of f

Norm-one projections onto subspaces of finite codimension in ℓ1andc0

✍ M. Baronti; P. Papini 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 689 KB

Norm-Attaining Operators into Strictly C

Norm-Attaining Operators into Strictly Convex Banach Spaces

✍ Francisco J Aguirre 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Almost Euclidean subspaces of ℓ1NVIA exp

Almost Euclidean subspaces of ℓ1NVIA expander codes

✍ Venkatesan Guruswami; James R. Lee; Alexander Razborov 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 631 KB

Chebyshev systems of continuous function

Chebyshev systems of continuous functions with values in two-dimensional strictly convex normed space

✍ V. A. Koshcheev 📂 Article 📅 1983 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 659 KB

Minimum ℓ1, ℓ2, and ℓ∞ Norm Approximate

Minimum ℓ1, ℓ2, and ℓ∞ Norm Approximate Solutions to an Overdetermined System of Linear Equations

✍ James A. Cadzow 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Many practical problems encountered in digital signal processing and other quantitative oriented disciplines entail finding a best approximate solution to an overdetermined system of linear equations. Invariably, the least squares error approximate solution (i.e., minimum 2 norm) is chosen for this