✦ LIBER ✦

The isodiametric problem for lattice-point-free convex sets

✍ Scribed by M. A. Hernández Cifre; S. Vassallo

Publisher: Akadmiai Kiad
Year: 2007
Tongue: English
Weight: 473 KB
Volume: 114
Category: Article
ISSN: 1588-2632
DOI: 10.1007/s10474-007-5184-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The isodiametric problem with lattice-po

The isodiametric problem with lattice-point constraints

✍ M. A. Hernández Cifre; A. Schürmann; F. Vallentin 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 127 KB

Improved convexity cuts for lattice poin

Improved convexity cuts for lattice point problems

✍ F. Glover; D. Klingman 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 473 KB

The Adaption Problem for Nonsymmetric Co

The Adaption Problem for Nonsymmetric Convex Sets

✍ E. Novak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 329 KB

We study the problem of optimal recovery in the case of a nonsymmetric convex class of functions. We compare adaptive and nonadaptive methods and prove a bound on how much better adaptive methods can be. We use new inequalities between Gelfand widths and Bernstein widths and new relations between th

An exterior point method for the convex

An exterior point method for the convex programming problem

✍ J. F. Andrus 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 982 KB

Fixed point theorems for the -set contra

Fixed point theorems for the -set contraction mapping on almost convex sets

✍ Chi-Ming Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 460 KB 👁 1 views

Hybrid Conjugate Gradient Method for a C

Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of

✍ H. Iiduka 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 569 KB