Cases of ineffectiveness of geometric cuts in sequential projection methods

DOI10.1080/10556788.2011.557433zbMath1223.49032OpenAlexW2095396663MaRDI QIDQ3093047

Paweł Białoń

Publication date: 12 October 2011

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.557433

zbMATH Keywords

projection methodszigzagginggeometric cuts

Mathematics Subject Classification ID

Convex programming (90C25) Discrete approximations in optimal control (49M25)

Cites Work

• Relaxed outer projections, weighted averages and convex feasibility
• Block-iterative surrogate projection methods for convex feasibility problems
• A method of projection onto an acute cone with level control in convex minimization
• On Projection Algorithms for Solving Convex Feasibility Problems
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods

This page was built for publication: Cases of ineffectiveness of geometric cuts in sequential projection methods