Projection algorithms for composite minimization

MaRDI QIDQ4569443zbMATH OpenFDO

Authors Xiaonan Yang, Hong-Kun Xu

Publication date 28 June 2018

zbMATH Keywords

projection algorithmconvex feasibilitycomposite minimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Methods of reduced gradient type (90C52) Hilbert subspaces (= operator ranges); complementation (Aronszajn, de Branges, etc.) (46C07)

Recommendations

• Projection algorithms with dynamic stepsize for constrained composite minimization
• Incremental gradient projection algorithm for constrained composite minimization problems
• A proximal-based deomposition method for compositions method for convex minimization problems
• A Parallel Algorithm for a Class of Convex Programs
• A strongly convergent parallel projection algorithm for convex feasibility problem

Cited in

(8)

• On the convergence of row-modification algorithm for matrix projections
• Iterative algorithms for solving projection operator onto the intersection of a finite family nonempty closed convex sets
• Incremental gradient projection algorithm for constrained composite minimization problems
• A note on the impact of the convex combination factor of a convex combination projection algorithm
• Projection algorithms with dynamic stepsize for constrained composite minimization
• A cyclic projected gradient method
• Iterative algorithms for split equilibrium problems of monotone operators and fixed point problems of pseudo-contractions
• scientific article; zbMATH DE number 2084778 (Why is no real title available?)

This page was built for publication: Projection algorithms for composite minimization

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