Selection strategies in projection methods for convex minimization problems

DOI10.7151/dmdico.1034zbMath1175.90310OpenAlexW2319636157MaRDI QIDQ4435576

R. Dylewski, Andrzej Cegielski

Publication date: 17 November 2003

Published in: Discussiones Mathematicae. Differential Inclusions, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4c84a6a9a2c1c22c09116d85fb58627cc8a85132

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items

Superiorization with level control ⋮ Variable target value relaxed alternating projection method ⋮ Projection methods for the linear split feasibility problems ⋮ A generalized projection-based scheme for solving convex constrained optimization problems

This page was built for publication: Selection strategies in projection methods for convex minimization problems