Iterative solution of convex problems by fejer-monotone methods

DOI10.1080/01630569508816676zbMath0853.65055OpenAlexW2074844432MaRDI QIDQ4883639

Dieter Schott

Publication date: 8 December 1996

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convergenceconvex optimizationHilbert spacesiterative methodscomputerized tomographyimage recoveryconvex problemconvex inequality systemsFejér-kernelsFejér-methodsFejér-monotone mappingszero-normal mappings

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Related Items

About strongly Fejér monotone mappings and their relaxations ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variable target value subgradient method
• Solution of projection problems over polytopes
• Convergence of sequential and asynchronous nonlinear paracontractions
• Iterative Optimierungsverfahren, die unter schwachen Voraussetzungen konvergieren
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I
• Image recovery by convex combinations of projections
• A general iterative scheme with applications to convex optimization and related fields
• The method of projections for finding the common point of convex sets
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs

This page was built for publication: Iterative solution of convex problems by fejer-monotone methods