$ M$-strongly convex subsets and their generating sets

Balashov, M. V.; Половинкин, Е. С.

doi:10.1070/sm2000v191n01abeh000447

Cited by 35 publications

(24 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similar notions have appeared earlier, and we recommend the reader to [22,2] for further references. Definition 1.1.…”

Section: Introductionmentioning

confidence: 93%

“…Suppose for every 0 ≤ i < j ≤ n the set V i ∪ V j is not a simplex in C, or equivalently, for every simplex S in C we have r(V \ S) ≥ n. We then show that there is a transversal of the partition which is not a simplex in C, which violates condition (2).…”

Section: Proof Of Proposition 33mentioning

confidence: 99%

“…In order to state our results, we need some definitions on strong convexity from [22,2]. Similar notions have appeared earlier, and we recommend the reader to [22,2] for further references.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Colorful theorems for strong convexity

Holmsen

Карасев

2016

Proc. Amer. Math. Soc.

View full text Add to dashboard Cite

Abstract. We prove two colorful Carathéodory theorems for strongly convex hulls, generalizing the colorful Caratéodory theorem for ordinary convexity by Imre Bárány, the non-colorful Carathéodory theorem for strongly convex hulls by the second author, and the "very colorful theorems" by the first author and others. We also investigate if the assumption of a "generating convex set" is really needed in such results and try to give a topological criterion for one convex body to be a Minkowski summand of another. IntroductionThe colorful Carathéodory theorem, discovered by Imre Bárány [3] (and independently in a dual form by Lovász), states that if X 0 , X 1 , . . . , X n are subsets in R n , each containing the origin in their convex hulls, then there exists a system of representatives x 0 ∈ X 0 , x 1 ∈ X 1 , . . . , x n ∈ X n such that the origin is contained in the convex hull of {x 0 , x 1 , . . . , x n }.The classical Carathéodory theorem [6] is recovered by setting X 0 = X 1 = · · · = X n . There are several remarkable applications of the colorful Carathéodory theorem in discrete geometry, such as in Sarkaria's proof of Tverberg's theorem and in the proof of the existence of weak ε-nets for convex sets. For further applications and references we recommend the reader to see Chapters 8, 9, and 10 in [19]. We recommend the survey [9] for general background on Carathéodory's theorem and its relatives.Recently there have been numerous generalizations of classical results from combinatorial convexity which focus on replacing convex sets by more general subsets of R n which are subject to certain topological constraints (see for instance [7,10,15,16,21] and references therein). These generalizations usually require tools from algebraic topology. In this paper we also use such topological tools, but we do so in order to solve problems which are purely affine.Our goal in this paper is to give an extension of the colorful Carathéodory theorem [3] to the notion of strong convexity and strongly convex hulls. This also generalizes the (noncolorful) Carathéodory theorem for strong convexity from [17]. In fact, the proof presented here is very similar to that in [17] In [18] it was shown that it is sufficient to test this property for those T that contain two elements; but we do not need this simplification here. It is relatively easy to check that all two-dimensional convex bodies, Euclidean balls, and simplices in every dimension are generating sets (see for instance section 3.2 of [23]). This property is also inherited under the Cartesian product operation. In [14] a criterion for checking this property for C 2 -smooth bodies was given, proving, in particular, that by sufficiently smooth perturbations of a ball one can obtain centrally symmetric generating sets which are not ellipsoids.in the above notation. The minimal K-strongly convex set containing a given set X is called its strongly convex hull, and can be found by the following formulaNote that the K-strongly convex hull is only defined for those X that are contain...

show abstract

“…Similar notions have appeared earlier, and we recommend the reader to [22,2] for further references. Definition 1.1.…”

Section: Introductionmentioning

confidence: 93%

Section: Proof Of Proposition 33mentioning

confidence: 99%

See 1 more Smart Citation

Colorful theorems for strong convexity

Holmsen

Карасев

2016

Proc. Amer. Math. Soc.

View full text Add to dashboard Cite

show abstract

“…A closed convex set B ⊂ R n is called strongly convex of radius r > 0 if it can be represented in the form B = x∈X B r (x) [36,5]. There are few equivalent properties for strong convexity: 1) A convex compact set B ⊂ R n is strongly convex of radius r if and only if for any pair of points x, y ∈ B the ball with center 1 2 (x + y) of radius 1 8r x − y 2 belongs to B [22,34,2].…”

Section: Definitions and Main Notationsmentioning

confidence: 99%

Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization

Balashov

Polyak

Tremba

2020

Numerical Functional Analysis and Optimization

View full text Add to dashboard Cite

Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for its solution and to obtain results that guarantee convergence of the algorithm under some minimal natural assumptions. We use the Ležanski-Polyak-Lojasiewicz condition on a manifold to prove the global linear convergence of the algorithm. Another method well fitted for the problem is the conditional gradient (Frank-Wolfe) algorithm. We examine some conditions which guarantee global convergence of full-step version of the method with linear rate.

show abstract

“…In the works [14,1] (a recent English reference is [10]) a strengthening of the notion of convexity was studied. The first natural example is to call a convex body A ⊂ R n R-strongly convex for a positive real R, if A is an intersection of balls of radius R. This notion seems to have been rediscovered many times (see the references in the cited works), and in [14,1] it was generalized to the following: For a fixed convex body K ⊂ R n , another convex body A is K-strongly convex if it is an intersection of translates of K.…”

Section: Introductionmentioning

confidence: 99%