Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
implicit hybrid methodinverse-strong monotonicityKadec-Klee propertyminimization problemmulti-step implicit iterative methodnonexpansive mappingOpial's conditionregularization
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30)
- Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
- Hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
- Hybrid extragradient method with regularization for convex minimization, generalized mixed equilibrium, variational inequality and fixed point problems
- Iterative schemes for convex minimization problems with constraints
- Iterative methods for generalized mixed equilibrium problems, fixed point problems and minimization problems
- An extragradient method for solving split feasibility and fixed point problems
- An extragradient-like approximation method for variational inequality problems and fixed point problems
- An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings
- Approximate proximal methods in vector optimization
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Asymptotically strict pseudocontractive mappings in the intermediate sense
- Averaged mappings and the gradient-projection algorithm
- Construction of fixed points of nonlinear mappings in Hilbert space
- Fixed point solutions of variational inequalities for a finite family of asymptotically nonexpansive mappings without common fixed point assumption
- Iterative methods for pseudomonotone variational inequalities and fixed-point problems
- Monotone Operators and the Proximal Point Algorithm
- On modified iterative method for nonexpansive mappings and monotone mappings
- On viscosity iterative methods for variational inequalities
- Regularization of nonlinear ill-posed variational inequalities and convergence rates
- Relaxed extragradient iterative methods for variational inequalities
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems
- Strong Convergence Theorem by a Hybrid Method for Nonexpansive Mappings and Lipschitz-Continuous Monotone Mappings
- Weak convergence of an iterative method for pseudomonotone variational inequalities and fixed-point problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings
- Weak convergence theorems for nonexpansive mappings and monotone mappings
- Multi-step iterative algorithm for minimization and fixed point problems in \(p\)-uniformly convex metric spaces
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- Strong convergence of a self-adaptive method for the split feasibility problem
- Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
- Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
- Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
- Iterative algorithms with regularization for hierarchical variational inequality problems and convex minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- scientific article; zbMATH DE number 7771100 (Why is no real title available?)
- A fast iterative regularization method for ill-posed problems
- An accelerated iterative regularization scheme for linear ill-posed problems
This page was built for publication: Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637545)