Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

DOI10.1080/02331934.2012.677447MaRDI QIDQ5169443zbMATH OpenOpenAlexFDO

Authors Yan Gao, Yazheng Dang

Publication date 10 July 2014

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convex feasibility problemnon-monotonous techniquesubgradient projection algorithm

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical methods based on nonlinear programming (49M37) Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Applications of mathematical programming (90C90)

Recommendations

• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• A parallel approximate subgradient projection algorithm for convex feasibility problem
• Non-monotoneous parallel iteration for solving convex feasibility problems.
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
• A parallel subgradient projections method for the convex feasibility problem

Cites work

• A parallel subgradient projections method for the convex feasibility problem
• Block-iterative surrogate projection methods for convex feasibility problems
• Cyclic subgradient projections
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• Linear Matrix Inequalities in System and Control Theory
• New iterative methods for linear inequalities
• On Projection Algorithms for Solving Convex Feasibility Problems
• On systems of inequalities with convex functions in the left sides
• On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• The constraint consensus method for finding approximately feasible points in nonlinear programs
• Viability criteria for differential inclusions

Cited in

(10)

• A nonmonotone projection method for constrained system of nonlinear equations
• An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
• An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
• A parallel approximate subgradient projection algorithm for convex feasibility problem
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
• Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
• Non-monotoneous parallel iteration for solving convex feasibility problems.
• Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
• Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
• A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.

This page was built for publication: Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

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