scientific article; zbMATH DE number 7347531

MaRDI QIDQ4988095zbMATH OpenFDO

Authors

Publication date 11 May 2021

Full work available at URL http://yokohamapublishers.jp/online-p/JNCA/vol21/jncav21n4p943.pdf

zbMATH Keywords

convergence analysisconvex minimization problemsfixed point problemsgradient projection methodPicard type iterative methodssplit feasibility problems

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37) Fixed-point and coincidence theorems (topological aspects) (54H25) Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cited in

(4)

• An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
• Iterative algorithms of generalized nonexpansive mappings and monotone operators with application to convex minimization problem
• Superiorization and bounded perturbation resilience of a gradient projection algorithm solving the convex minimization problem
• A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988095)