General iterative algorithms for solving unconstrained convex optimization problems

DOI10.13482/J.ISSN1001-7011.2015.05.229MaRDI QIDQ3461404zbMATH OpenFDO

Authors Peichao Duan, Miaomiao Song

Publication date 15 January 2016

Full work available at URL https://doi.org/10.13482/J.ISSN1001-7011.2015.05.229

zbMATH Keywords

fixed pointgeneral iterative algorithmsproximal methodvariational inequality

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30)

Recommendations

• General iterative methods for system of equilibrium problems and constrained convex minimization problem in Hilbert spaces
• A general iterative method of fixed points for equilibrium problems and optimization problems
• Iterative schemes for convex minimization problems with constraints
• Iterative methods for constrained convex minimization problem in Hilbert spaces
• Iterative algorithms for solving mixed equilibrium problems and constrained convex minimization problems

Cited in

(1)

• A general iterative scheme with applications to convex optimization and related fields

This page was built for publication: General iterative algorithms for solving unconstrained convex optimization problems

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