On solving of constrained convex minimize problem using gradient projection method
From MaRDI portal
Publication:1728981
DOI10.1155/2018/1580837zbMath1492.47082OpenAlexW2892433564WikidataQ129156719 ScholiaQ129156719MaRDI QIDQ1728981
Taksaporn Sirirut, Pattanapong Tianchai
Publication date: 27 February 2019
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/1580837
Numerical mathematical programming methods (65K05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A regularized gradient projection method for the minimization problem
- Extragradient-projection method for solving constrained convex minimization problems
- Variant gradient projection methods for the minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- Averaged mappings and the gradient-projection algorithm
- Gradient projection method with a new step size for the split feasibility problem
- Strong convergence of iterative methods for \(k\)-strictly pseudo-contractive mappings in Hilbert spaces
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping
- Perturbation techniques for nonexpansive mappings with applications
- Strong convergence of composite iterative methods for equilibrium problems and fixed point problems
- A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping
- A multiprojection algorithm using Bregman projections in a product space
- An alternating projection that does not converge in norm
- Viscosity approximation methods for nonexpansive mappings
- A strong convergence theorem for equilibrium problems and split feasibility problems in Hilbert spaces
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- Strong convergence theorems by hybrid methods for families of nonexpansive mappings in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Projected gradient methods for linearly constrained problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator