Cases of ineffectiveness of geometric cuts in sequential projection methods

DOI10.1080/10556788.2011.557433MaRDI QIDQ3093047zbMATH OpenOpenAlexFDO

Authors Paweł Białoń

Publication date 12 October 2011

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

geometric cutsprojection methodszigzagging

Mathematics Subject Classification ID

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

Recommendations

• How good are projection methods for convex feasibility problems?
• A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters

Cites work

• A method of projection onto an acute cone with level control in convex minimization
• Block-iterative surrogate projection methods for convex feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Relaxed outer projections, weighted averages and convex feasibility
• 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

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