A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction

MaRDI QIDQ5030893zbMATH OpenFDO

Authors Nimit Nimana, Thitima Paeko, Narin Petrot

Publication date 17 February 2022

Full work available at URL http://www.ybook.co.jp/online2/oplna/vol7/p285.html

zbMATH Keywords

conjugate gradient methodsfixed point setminimization problemnonexpansivestrongly convex

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Equations involving nonlinear operators (general) (47J05) Numerical optimization and variational techniques (65K10)

Recommendations

• Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
• Publication:3471857
• A Hybrid Steepest-Descent Algorithm for Convex Minimization Over the Fixed Point Set of Multivalued Mappings

Cited in

(2)

• A hybrid steepest descent method for constrained convex optimization
• Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization

This page was built for publication: A relaxed hybrid steepest descent method for solving strongly convex minimization problem via conjugate gradient direction

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