Averaged mappings and the gradient-projection algorithm
From MaRDI portal
(Redirected from Publication:639932)
Recommendations
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- scientific article; zbMATH DE number 6921240
- Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- General iterative methods for equilibrium and constrained convex minimization problem
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new proximal point iteration that converges weakly but not in norm
- A regularization method for the proximal point algorithm
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- An alternating projection that does not converge in norm
- Convergence of generalized proximal point algorithms
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Forcing strong convergence of proximal point iterations in a Hilbert space
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 2067645 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Monotone Operators and the Proximal Point Algorithm
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Perturbation techniques for nonexpansive mappings with applications
- Projected gradient methods for linearly constrained problems
- Projection and proximal point methods: Convergence results and counterexamples.
- Projection methods for variational inequalities with application to the traffic assignment problem
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Strong convergence of the CQ method for fixed point iteration processes
- The multiple-sets split feasibility problem and its applications for inverse problems
- Viscosity approximation methods for fixed-points problems
- Viscosity approximation methods for nonexpansive mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Weak convergence theorems for nonexpansive mappings in Banach spaces
Cited in
(only showing first 100 items - show all)- The combination projection method for solving convex feasibility problems
- A modified iterative method for a finite collection of non-self mappings and a family of variational inequality problems
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- Iterative methods for a class of variational inequalities in Hilbert spaces
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- An iterative method for split inclusion problems without prior knowledge of operator norms
- Algorithms of common solutions for generalized mixed equilibria, variational inclusions, and constrained convex minimization
- Iterative schemes for convex minimization problems with constraints
- The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
- Hybrid extragradient method with regularization for convex minimization, generalized mixed equilibrium, variational inequality and fixed point problems
- Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
- Multistep hybrid iterations for systems of generalized equilibria with constraints of several problems
- Hybrid iterative scheme for triple hierarchical variational inequalities with mixed equilibrium, variational inclusion, and minimization constraints
- Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
- On solving of constrained convex minimize problem using gradient projection method
- The conjugate gradient method for split variational inclusion and constrained convex minimization problems
- Iterative methods for zeros of a monotone variational inclusion in Hilbert spaces
- Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems
- A note on approximating curve with 1-norm regularization method for the split feasibility problem
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- An iteration scheme for contraction mappings with an application to synchronization of discrete logistic maps
- A modified iterative method for capturing a common solution of split generalized equilibrium problem and fixed point problem
- A modified Halpern's iterative scheme for solving split feasibility problems
- Convergence theorems for the variational inequality problems and split feasibility problems in Hilbert spaces
- Strong convergence of double-projection method for variational inequality problems
- Convergence analysis of a general iterative algorithm for finding a common solution of split variational inclusion and optimization problems
- A modified iterative method for split problem of variational inclusions and fixed point problems
- Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces
- A general iterative scheme based on regularization for solving equilibrium and constrained convex minimization problems
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- A strong convergence algorithm for a fixed point constrained split null point problem
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem
- Algorithms for the common solution of the split variational inequality problems and fixed point problems with applications
- Self-adaptive subgradient extragradient method with inertial modification for solving monotone variational inequality problems and quasi-nonexpansive fixed point problems
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Convergence analysis of a variable metric forward-backward splitting algorithm with applications
- Strong convergence of subgradient extragradient method with regularization for solving variational inequalities
- Inertial hybrid algorithm for variational inequality problems in Hilbert spaces
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- New inertial proximal gradient methods for unconstrained convex optimization problems
- Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of -inverse strongly monotone operators
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- Iterative regularization methods with new stepsize rules for solving variational inclusions
- On a system of monotone variational inclusion problems with fixed-point constraint
- Remark on the Yosida approximation iterative technique for split monotone Yosida variational inclusions
- Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications
- The split feasibility problem with multiple output sets in Hilbert spaces
- Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- Strong convergence of projection methods for a countable family of nonexpansive mappings and applications to constrained convex minimization problems
- Strong convergence of a self-adaptive method for the split feasibility problem
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- Convex minimization with constraints of systems of variational inequalities, mixed equilibrium, variational inequality, and fixed point problems
- Triple hierarchical variational inequalities with constraints of mixed equilibria, variational inequalities, convex minimization, and hierarchical fixed point problems
- On the role of the coefficients in the strong convergence of a general type Mann iterative scheme
- The viscosity technique for the implicit midpoint rule of nonexpansive mappings in Hilbert spaces
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- The split common fixed point problem for a family of multivalued quasinonexpansive mappings and totally asymptotically strictly pseudocontractive mappings in Banach spaces
- Relaxed viscosity approximation methods with regularization for constrained minimization problems
- The regularized CQ algorithm without \textit{a priori} knowledge of operator norm for solving the split feasibility problem
- Extragradient method for convex minimization problem
- An iterative method for a common solution of generalized mixed equilibrium problems, variational inequalities, and hierarchical fixed point problems
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- Multi-step iterative algorithms with regularization for triple hierarchical variational inequalities with constraints of mixed equilibria, variational inclusions, and convex minimization
- Regularized hybrid iterative algorithms for triple hierarchical variational inequalities
- Strong convergence of a modified proximal algorithm for solving the lasso
- A regularization algorithm for a common solution of generalized equilibrium problem, fixed point problem and the zero points of the sum of two operators
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Multi-step implicit iterative methods with regularization for minimization problems and fixed point problems
- Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces
- On the strong convergence of a general-type Krasnosel'skii-Mann's algorithm depending on the coefficients
- One-step optimization method for equilibrium problems
- New inertial forward-backward algorithm for convex minimization with applications
- One-step iterative method for bilevel equilibrium problem in Hilbert space
- Generalized Halpern iteration with new control conditions and its application
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- scientific article; zbMATH DE number 5802243 (Why is no real title available?)
- scientific article; zbMATH DE number 7447682 (Why is no real title available?)
- Weak convergence theorem for variational inequality problems with monotone mapping in Hilbert space
- A convergence analysis result for constrained convex minimization problem
- An iterative method with norm convergence for a class of generalized equilibrium problems
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Iterative approximation of solutions for constrained convex minimization problem
- A simpler explicit iterative algorithm for a class of variational inequalities in Hilbert spaces
- Iterative algorithms with regularization for hierarchical variational inequality problems and convex minimization problems
- A regularized gradient projection method for the minimization problem
- Strong convergence of a projected gradient method
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Variant gradient projection methods for the minimization problems
- Interpolating vector fields for near identity maps and averaging
- Single projection method for pseudo-monotone variational inequality in Hilbert spaces
- More general viscosity implicit midpoint rule for nonexpansive mapping with applications
- Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- The ball-relaxed CQ algorithms for the split feasibility problem
This page was built for publication: Averaged mappings and the gradient-projection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639932)
