Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Convex set

Known as: Set, Convexity (mathematics), Convex 
In Euclidean space, a convex set is the region such that, for every pair of points within the region, every point on the straight line segment that… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Convex programming involves a convex set F ⊆ Rn and a convex cost function c : F → R. The goal of convex programming is to find a… Expand
  • figure 1
  • figure 3
Highly Cited
2002
Highly Cited
2002
Let C and Q be nonempty closed convex sets in RN and RM, respectively, and A an M by N real matrix. The split feasibility problem… Expand
Highly Cited
2000
Highly Cited
2000
Nonmonotone projected gradient techniques are considered for the minimization of differentiable functions on closed convex sets… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
1996
Highly Cited
1996
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex… Expand
Highly Cited
1996
Highly Cited
1996
AbstractLet $$S \subseteq \mathbb{R}^n $$ be a convex set for which there is an oracle with the following property. Given any… Expand
Highly Cited
1977
Highly Cited
1977
A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented. It… Expand
  • figure 1
  • table I
  • figure 2
  • table II
Highly Cited
1965
Highly Cited
1965
  • L. Zadeh
  • Inf. Control.
  • 1965
  • Corpus ID: 205883170
A fuzzy set is a class of objects with a continuum of grades of membership. Such a set is characterized by a membership… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1964
Highly Cited
1964
This note gives a construction for minimizing certain twice-differentiable functions on a closed convex subset C, of a Hubert… Expand
Highly Cited
1959
Highly Cited
1959
The method of successive approximation is applied to the problem of obtaining points of minimum distance on two convex sets… Expand
Highly Cited
1952
Highly Cited
1952
so that the set of all convex sets of L is a commutative semigroup under addition. If the situation had been such that it was not… Expand