Iterative solution of convex problems by fejer-monotone methods

DOI10.1080/01630569508816676MaRDI QIDQ4883639zbMATH OpenOpenAlexFDO

Authors 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

computerized tomographyconvergenceconvex inequality systemsconvex optimizationconvex problemFejér-kernelsFejér-methodsFejér-monotone mappingsHilbert spacesimage recoveryiterative methodszero-normal mappings

Mathematics Subject Classification ID

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

Recommendations

• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I
• About strongly Fejér monotone mappings and their relaxations
• scientific article; zbMATH DE number 1098564
• scientific article; zbMATH DE number 1176657

Cites work

• A general iterative scheme with applications to convex optimization and related fields
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• Convergence of sequential and asynchronous nonlinear paracontractions
• scientific article; zbMATH DE number 3877856 (Why is no real title available?)
• scientific article; zbMATH DE number 3707238 (Why is no real title available?)
• scientific article; zbMATH DE number 3511061 (Why is no real title available?)
• scientific article; zbMATH DE number 3572682 (Why is no real title available?)
• Image recovery by convex combinations of projections
• Iterative Optimierungsverfahren, die unter schwachen Voraussetzungen konvergieren
• Solution of projection problems over polytopes
• 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
• The method of projections for finding the common point of convex sets
• Variable target value subgradient method

Cited in

(12)

• 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
• About strongly Fejér monotone mappings and their relaxations
• Synthesis of Fejér mappings with different image spaces.
• Iterative algorithm for solving a class of convex feasibility problem
• Iterative Fejér processes in ill-posed problems
• Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
• A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
• scientific article; zbMATH DE number 3958587 (Why is no real title available?)
• On finitely convergent iterative methods for the convex feasibility problem
• scientific article; zbMATH DE number 2033480 (Why is no real title available?)
• Fejér processes: synthesis and randomization

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

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