The use of additional diminishing disturbances in Fejer models of iterative algorithms

DOI10.1134/s0965542508120051MaRDI QIDQ6191486

E. A. Nurminskii

Publication date: 7 March 2024

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/zvmmf67

zbMATH Keywords

projection methodsfeasibility problemdecomposition of optimization problemsFejer processes

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (5)

Adaptive two-stage Bregman method for variational inequalities ⋮ Strongly Convergent Algorithms for Variational Inequality Problem Over the Set of Solutions the Equilibrium Problems ⋮ Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators ⋮ Projected subgradient minimization versus superiorization ⋮ Convergence of two-stage method with Bregman divergence for solving variational inequalities

Cites Work

• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On Projection Algorithms for Solving Convex Feasibility Problems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: The use of additional diminishing disturbances in Fejer models of iterative algorithms