Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour

DOI10.1080/02331934.2018.1509214OpenAlexW2888196057MaRDI QIDQ4613990

Nimit Nimana, Andrzej Cegielski

Publication date: 28 January 2019

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convex feasibility problemsubgradient projectioncyclic projectionsextrapolated methods

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets

Uses Software

• PLCP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and strong convergence of algorithms involving averaged nonexpansive operators
• Iterative methods for fixed point problems in Hilbert spaces
• Extrapolation and local acceleration of an iterative process for common fixed point problems
• Hilbertian convex feasibility problem: Convergence of projection methods
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• A parallel subgradient projections method for the convex feasibility problem
• General method for solving the split common fixed point problem
• Introduction to Nonsmooth Optimization
• Generalized relaxation of string averaging operators based on strictly relaxed cutter operators
• Cyclic subgradient projections
• Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
• Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
• On Projection Algorithms for Solving Convex Feasibility Problems
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour