A general iterative scheme with applications to convex optimization and related fields

DOI10.1080/02331939108843731zbMath0734.65049OpenAlexW2139491842MaRDI QIDQ3361812

Dieter Schott

Publication date: 1991

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global convergencevariational inequalitiesconvex optimizationHilbert spaceiterative methodsnonexpansive operatorsacceleration of convergenceoperator equationssystems of linear equationssubgradient methodsrelaxation parametersconvex feasibility problemssystems of convex inequalitiesmethods of successive orthogonal projections with relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Methods of reduced gradient type (90C52)

Related Items (7)

Opial-Type Theorems and the Common Fixed Point Problem ⋮ 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 ⋮ Geometrically convergent projection method in matrix games ⋮ About strongly Fejér monotone mappings and their relaxations ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence statements for projection type linear iterative methods with relaxations
• Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation
• 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
• Konvergenzsätze für Verallgemeinerungen von PSH- und SPA-Verfahren
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A general iterative scheme with applications to convex optimization and related fields