A regularized gradient projection method for the minimization problem
From MaRDI portal
Summary: We investigate the following regularized gradient projection algorithm \(x_{n+1} = P_C(I - \gamma_n(\nabla f + \alpha_n I))x_n, n \geq 0\). Under some different control conditions, we prove that this gradient projection algorithm strongly converges to the minimum norm solution of the minimization problem \(\min_{x \in C}f(x)\).
Recommendations
- Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A general iterative method for solving constrained convex minimization problems
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Averaged mappings and the gradient-projection algorithm
Cites work
- A note on the gradient projection method with exact stepsize rule
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- An iterative algorithm for a hierarchical problem
- Averaged mappings and the gradient-projection algorithm
- Convergence of the gradient projection method for generalized convex minimization
- Convergence properties of projection and contraction methods for variational inequality problems
- Convexly constrained linear inverse problems: Iterative least-squares and regularization
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 6921240 (Why is no real title available?)
- Iterative Algorithms for Nonlinear Operators
- Nonlinear optimization.
- Projected gradient methods for linearly constrained problems
- Schemes for finding minimum-norm solutions of variational inequalities
- Strong convergence of a modified extragradient method to the minimum-norm solution of variational inequalities
- Strong convergence of a proximal point algorithm with general errors
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Two-Metric Projection Methods for Constrained Optimization
- Two-step projection methods for a system of variational inequality problems in Banach spaces
Cited in
(25)- Continuous regularized proximal minimization method
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- On solving of constrained convex minimize problem using gradient projection method
- An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications
- The minimal-norm Gauss-Newton method and some of its regularized variants
- Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications
- Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems
- Regularized continuous gradient projection method for minimization problems with inaccurate source data
- A convergence analysis result for constrained convex minimization problem
- scientific article; zbMATH DE number 5288608 (Why is no real title available?)
- scientific article; zbMATH DE number 1042861 (Why is no real title available?)
- Strong convergence of a projected gradient method
- Variant gradient projection methods for the minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
- scientific article; zbMATH DE number 946716 (Why is no real title available?)
- A proximal regularization of the steepest descent method
- The Minimal Error Conjugate Gradient Method is a Regularization Method
- scientific article; zbMATH DE number 915951 (Why is no real title available?)
- scientific article; zbMATH DE number 915954 (Why is no real title available?)
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Newton projection method as applied to assembly simulation
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- Incremental gradient projection algorithm for constrained composite minimization problems
- A regularized two-step projection method for constrained minimization problems
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
This page was built for publication: A regularized gradient projection method for the minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410905)
