Convex set

Known as: Convexity, Convex, Convex region 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1949-2018
0500100019492017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In this paper we study a first-order primal-dual algorithm for non-smooth convex optimization problems with known saddle-point… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider a chance constrained problem, where one seeks to minimize a convex objective over solutions satisfying, with a given… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear… (More)
  • figure 1
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Convex programming involves a convex set F ⊆ R and a convex cost function c : F → R. The goal of convex programming is to find a… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Nonmonotone projected gradient techniques are considered for the minimization of differentiable functions on closed convex sets… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented… (More)
Is this relevant?