Variant gradient projection methods for the minimization problems
From MaRDI portal
Publication:448815
DOI10.1155/2012/792078zbMath1248.49046WikidataQ58696798 ScholiaQ58696798MaRDI QIDQ448815
Ching-Feng Wen, Yeong-Cheng Liou, Yonghong Yao
Publication date: 7 September 2012
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/792078
gradient projection algorithm: constrained convex minimization problems; strong convergence.; weak convergence in infinite-dimensional Hilbert spaces
Related Items
Approximation of solutions to constrained convex minimization problem in Hilbert spaces, On solving of constrained convex minimize problem using gradient projection method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms of common solutions for variational inclusions, mixed equilibrium problems and fixed point problems
- Averaged mappings and the gradient-projection algorithm
- A hybrid projection algorithm for finding solutions of mixed equilibrium problem and variational inequality problem
- Perturbation techniques for nonexpansive mappings with applications
- On a two-step algorithm for hierarchical fixed point problems and variational inequalities
- A multiprojection algorithm using Bregman projections in a product space
- An iterative approach to quadratic optimization
- Convergence of the gradient projection method for generalized convex minimization
- An iterative approach to a constrained least squares problem
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Two-step projection methods for a system of variational inequality problems in Banach spaces
- Strong convergence of the CQ method for fixed point iteration processes
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Convexly constrained linear inverse problems: iterative least-squares and regularization
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Two-Metric Projection Methods for Constrained Optimization
- 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
- A New Projection Method for Variational Inequality Problems
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- On Projection Algorithms for Solving Convex Feasibility Problems
- 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
- Convergence properties of projection and contraction methods for variational inequality problems
