Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities
DOI10.1007/s10957-006-9068-xzbMath1137.47059OpenAlexW2029357079MaRDI QIDQ995948
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9068-x
convergenceiterative algorithmsHilbert spacesnonexpansive mapsmodified hybrid steepest-descent methods with variable parameters
Minimax problems in mathematical programming (90C47) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of hybrid steepest-descent methods for variational inequalities
- Variational inequalities and the pricing of American options
- Approximation of fixed points of nonexpansive mappings
- On a general projection algorithm for variational inequalities
- An iterative approach to quadratic optimization
- Combined relaxation methods for variational inequalities
- Completely generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces
- Iterative algorithm for finding approximate solutions to completely generalized strongly nonlinear quasivariational inequalities
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Variational Inequalities with Generalized Monotone Operators
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- On Projection Algorithms for Solving Convex Feasibility Problems