A method to find a point of a convex set

DOI10.1007/BF01093422MaRDI QIDQ1116082zbMATH OpenFDO

Authors R. F. Khabibullin

Publication date 1987

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01093422

zbMATH Keywords

convex setHilbert spacesupporting conesupporting functionals

Mathematics Subject Classification ID

Inner product spaces and their generalizations, Hilbert spaces (46C99) Nonsmooth analysis (49J52) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Review text

We consider an iterative method that finds a point of a convex set in a Hilbert space. The proposed method is, in a certain sense, close to the methods described by I. I. Eremin, L. M. Brégman, L. G. Gurin et. al., and B. T. Polyak.

Recommendations

• scientific article; zbMATH DE number 3874995
• scientific article; zbMATH DE number 3912113
• Finding projections onto the intersection of convex sets in hilbert spaces
• Iterations of parallel convex projections in hilbert spaces
• A finite method to find a point in a set defined by a convex differentiable functional

Cited in

(8)

• A finite method to find a point in a set defined by a convex differentiable functional
• Finding an element in a set by the successive relaxation method
• Generalized descent method for minimization of functionals
• The support-vector algorithm with compound step
• Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
• scientific article; zbMATH DE number 3874995 (Why is no real title available?)
• Graef-Younes method with backward iteration
• A generalized projection-based scheme for solving convex constrained optimization problems

This page was built for publication: A method to find a point of a convex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116082)