scientific article

zbMATH Open0609.90099MaRDI QIDQ3750531

Vladimir Darmacheev

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relaxation methodgeometric convergence ratecomputation of a pointintersection of projections of convex closed sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On relaxed and contraction-proximal point algorithms in Hilbert spaces 👍 👎
• The method of alternating relaxed projections for two nonconvex sets 👍 👎
• A new projection method for finding the closest point in the intersection of convex sets 👍 👎
• An iterative procedure for obtaining I-projections onto the intersection of convex sets 👍 👎
• The relaxation method for certain type of pseudoconvex programming problems 👍 👎
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space 👍 👎
• Projections on convex sets in the relaxed limit 👍 👎

This page was built for publication: