Fejer algorithms with an adaptive step

DOI10.1134/S0965542511050137MaRDI QIDQ2898114zbMATH OpenFDO

Authors E. A. Nurminski

Publication date 16 July 2012

Published in Zhurnal Vychislitel'noĭ Matematiki i Matematicheskoĭ Fiziki (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542511050137

zbMATH Keywords

adaptive stepconvergenceconvex optimizationdecompositionFejer processesnumerical resultsvariational inequalities

Mathematics Subject Classification ID

Variational inequalities (49J40) Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Numerical methods for variational inequalities and related problems (65K15) Convex programming (90C25)

Recommendations

• Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
• Fejér processes: synthesis and randomization
• Fejér processes in theory and practice: recent results
• Fejér processes with diminishing disturbances
• scientific article; zbMATH DE number 3264641

Cited in

(6)

• Projected subgradient minimization versus superiorization
• Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
• On N. Z. Shor's three scientific ideas
• String-averaging projected subgradient methods for constrained minimization
• The use of additional diminishing disturbances in Fejer models of iterative algorithms
• An accelerated Fejér-type process for finding a non-negative solution to a system of linear algebraic equations

This page was built for publication: Fejer algorithms with an adaptive step

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