Averaged mappings and the gradient-projection algorithm
From MaRDI portal
Publication:639932
DOI10.1007/s10957-011-9837-zzbMath1233.90280OpenAlexW2088305447MaRDI QIDQ639932
Publication date: 11 October 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9837-z
regularizationmaximal monotone operatorconstrained convex minimizationgradient-projection algorithmaveraged mappingminimum-normrelaxed gradient-projection algorithm
Related Items
Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ Inertial modified projection algorithm with self-adaptive technique for solving pseudo-monotone variational inequality problems in Hilbert spaces ⋮ A convergence analysis result for constrained convex minimization problem ⋮ Unnamed Item ⋮ Stochastic approximation results for variational inequality problem using random-type iterative schemes ⋮ Unnamed Item ⋮ One-step optimization method for equilibrium problems ⋮ Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function ⋮ Unnamed Item ⋮ Convergence analysis of the Halpern iteration with adaptive anchoring parameters ⋮ Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem ⋮ On split generalized equilibrium problem with multiple output sets and common fixed points problem ⋮ Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems ⋮ Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces ⋮ An adaptive block iterative process for a class of multiple sets split variational inequality problems and common fixed point problems in Hilbert spaces ⋮ Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method ⋮ New inertial forward-backward algorithm for convex minimization with applications ⋮ One-step iterative method for bilevel equilibrium problem in Hilbert space ⋮ Iterative method for split equilibrium problem and minimization problem via conjugate gradient method ⋮ Generalized Halpern iteration with new control conditions and its application ⋮ Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem ⋮ Single projection method for pseudo-monotone variational inequality in Hilbert spaces ⋮ Unnamed Item ⋮ Iterative methods for the split feasibility problem and the fixed point problem in Banach spaces ⋮ Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings ⋮ 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 ⋮ A new iterative method for generalized equilibrium and constrained convex minimization problems ⋮ Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces ⋮ Strong convergence of viscosity forward-backward algorithm to the sum of two accretive operators in Banach space ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ On the optimal relaxation parameters of Krasnosel'ski–Mann iteration ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ Unnamed Item ⋮ Modified Inertial Algorithms for a Class of Split Feasibility Problems and Fixed Point Problems in Hilbert Spaces ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm ⋮ On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces ⋮ New iterative methods for equilibrium and constrained convex minimization problems ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space ⋮ The subgradient extragradient method for pseudomonotone equilibrium problems ⋮ Finding a solution of split null point of the sum of monotone operators without prior knowledge of operator norms in Hilbert spaces ⋮ Projection algorithms with dynamic stepsize for constrained composite minimization ⋮ A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems ⋮ General iterative methods for equilibrium and constrained convex minimization problem ⋮ A modified hybrid algorithm for solving a composite minimization problem in Banach spaces ⋮ Notes on a neural network approach to inverse variational inequalities ⋮ Inertial Haugazeau's hybrid subgradient extragradient algorithm for variational inequality problems in Banach spaces ⋮ Perturbed iterative methods for a general family of operators: convergence theory and applications ⋮ Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems ⋮ On the inertial forward-backward splitting technique for solving a system of inclusion problems in Hilbert spaces ⋮ A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems ⋮ Strong convergence algorithm for the split problem of variational inclusions, split generalized equilibrium problem and fixed point problem ⋮ Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators 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 ⋮ On the strong convergence of a general-type Krasnosel'skii-Mann's algorithm depending on the coefficients ⋮ Mann type iterative methods for finding a common solution of split feasibility and fixed point problems ⋮ Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings ⋮ Strong convergence theorems for a class of split feasibility problems and fixed point problem in Hilbert spaces ⋮ Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces ⋮ Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators ⋮ Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem ⋮ The ball-relaxed gradient-projection algorithm for split feasibility problem ⋮ The combination projection method for solving convex feasibility problems ⋮ Relaxed viscosity approximation methods with regularization for constrained minimization problems ⋮ A modified iterative method for a finite collection of non-self mappings and a family of variational inequality problems ⋮ Iterative regularization methods with new stepsize rules for solving variational inclusions ⋮ 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 ⋮ On a system of monotone variational inclusion problems with fixed-point constraint ⋮ Weak convergence theorem for variational inequality problems with monotone mapping in Hilbert space ⋮ An iterative method with norm convergence for a class of generalized equilibrium 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 ⋮ Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem ⋮ A modified Halpern's iterative scheme for solving split feasibility problems ⋮ Iterative approximation of solutions for constrained convex minimization problem ⋮ 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 ⋮ A simpler explicit iterative algorithm for a class of variational inequalities in Hilbert spaces ⋮ A hybrid iterative method with averaged mappings for hierarchical fixed point problems and variational inequalities ⋮ An iterative method for split inclusion problems without prior knowledge of operator norms ⋮ Iterative algorithms with regularization for hierarchical variational inequality problems and convex minimization problems ⋮ A regularized gradient projection method for the minimization problem ⋮ The common solutions of the split feasibility problems and fixed point problems ⋮ MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications ⋮ Remark on the Yosida approximation iterative technique for split monotone Yosida variational inclusions ⋮ 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 ⋮ Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications ⋮ Algorithms of common solutions for generalized mixed equilibria, variational inclusions, and constrained convex minimization ⋮ Iterative schemes for convex minimization problems with constraints ⋮ A general iterative method for solving constrained convex minimization problems ⋮ 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 ⋮ Hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense ⋮ On solving of constrained convex minimize problem using gradient projection method ⋮ The split feasibility problem with multiple output sets in Hilbert spaces ⋮ The conjugate gradient method for split variational inclusion and constrained convex minimization problems ⋮ Convergence theorems for the variational inequality problems and split feasibility problems in Hilbert spaces ⋮ Approximation of solutions to constrained convex minimization problem in Hilbert spaces ⋮ Strong convergence of double-projection method for variational inequality problems ⋮ Iterative methods for zeros of a monotone variational inclusion in Hilbert spaces ⋮ Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem ⋮ Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems ⋮ Convergence analysis of a general iterative algorithm for finding a common solution of split variational inclusion and optimization problems ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ A modified iterative method for split problem of variational inclusions and fixed point 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 ⋮ Hybrid gradient-projection algorithm for solving constrained convex minimization problems with generalized mixed equilibrium problems ⋮ Weak convergence theorem for a class of split variational inequality problems and applications in a Hilbert space ⋮ 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 ⋮ Weak convergence theorems for split feasibility problems on zeros of the sum of monotone operators and fixed point sets in Hilbert spaces ⋮ Some iterative methods for finding fixed points and for solving constrained convex minimization problems ⋮ 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 ⋮ 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 ⋮ Properties and iterative methods for the lasso and its variants ⋮ A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem ⋮ Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces ⋮ 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 ⋮ Strong convergence results for convex minimization and monotone variational inclusion problems in Hilbert space ⋮ 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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A regularization method for the proximal point algorithm
- Perturbation techniques for nonexpansive mappings with applications
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- A multiprojection algorithm using Bregman projections in a product space
- Projection and proximal point methods: Convergence results and counterexamples.
- Convergence of generalized proximal point algorithms
- An alternating projection that does not converge in norm
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Viscosity approximation methods for nonexpansive mappings
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Viscosity approximation methods for fixed-points problems
- Strong convergence of the CQ method for fixed point iteration processes
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Projected gradient methods for linearly constrained problems
- Projection methods for variational inequalities with application to the traffic assignment problem
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A new proximal point iteration that converges weakly but not in norm
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
