Projection algorithms for composite minimization
From MaRDI portal
Publication:4569443
zbMATH Open1399.90209MaRDI QIDQ4569443FDOQ4569443
Authors: Xiaonan Yang, Hong-Kun Xu
Publication date: 28 June 2018
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
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)
Cited In (6)
- A cyclic projected gradient method
- Incremental gradient projection algorithm for constrained composite minimization problems
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Iterative algorithms for split equilibrium problems of monotone operators and fixed point problems of pseudo-contractions
- Title not available (Why is that?)
- On the convergence of row-modification algorithm for matrix projections
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)