Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

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

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

Highly Cited

1965

Highly Cited

1965

A fuzzy set is a class of objects with a continuum of grades of membership. Such a set is characterized by a membership… Expand

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