Variant gradient projection methods for the minimization problems
From MaRDI portal
Recommendations
- A general iterative method for solving constrained convex minimization problems
- Strong convergence of the gradient-projection algorithm in Hilbert spaces
- A hybrid gradient-projection algorithm for averaged mappings in Hilbert spaces
- Averaged mappings and the gradient-projection algorithm
- A regularized gradient projection method for the minimization problem
Cites work
- 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?)
- A New Projection Method for Variational Inequality Problems
- A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem
- A multiprojection algorithm using Bregman projections in a product space
- 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
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- An iterative approach to a constrained least squares problem
- An iterative approach to quadratic optimization
- 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
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Nonlinear optimization.
- On Projection Algorithms for Solving Convex Feasibility Problems
- On a two-step algorithm for hierarchical fixed point problems and variational inequalities
- Perturbation techniques for nonexpansive mappings with applications
- Projected gradient methods for linearly constrained problems
- Strong convergence of the CQ method for fixed point iteration processes
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- The multiple-sets split feasibility problem and its applications for inverse problems
- Two-Metric Projection Methods for Constrained Optimization
- Two-step projection methods for a system of variational inequality problems in Banach spaces
Cited in
(9)- On solving of constrained convex minimize problem using gradient projection method
- A variational approach to the alternating projections method
- Strong convergence of the gradient-projection algorithm in Hilbert spaces
- Conversion of algorithms by releasing projection for minimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- Strong convergence of a projected gradient method
- Approximation of solutions to constrained convex minimization problem in Hilbert spaces
- Strong convergence results for convex minimization and monotone variational inclusion problems in Hilbert space
- Refinements of some convergence results of the gradient-projection algorithm
This page was built for publication: Variant gradient projection methods for the minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448815)
