Sciweavers

1387 search results - page 52 / 278
» Convexity in Discrete Space
Sort
View
WCE
2007
13 years 11 months ago
A Comparison of Mann and Ishikawa iterations of quasi-contraction operators
—It is generally conjectured that the Mann iteration converges faster than the Ishikawa iteration for any operator defined on an arbitrary closed convex subset of a Banach space...
Johnson O. Olaleru
OL
2007
87views more  OL 2007»
13 years 9 months ago
Proximality and Chebyshev sets
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimens...
Jonathan M. Borwein
CCCG
2007
13 years 11 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 9 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
COMGEO
2008
ACM
13 years 9 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff