Projection algorithms with dynamic stepsize for constrained composite minimization
From MaRDI portal
Publication:5225430
DOI10.22436/jnsa.011.07.05zbMath1438.90391OpenAlexW2805135465WikidataQ129752138 ScholiaQ129752138MaRDI QIDQ5225430
Ru Dong Chen, Yu Jing Wu, Luo Yi Shi
Publication date: 22 July 2019
Published in: Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.011.07.05
Uses Software
Cites Work
- Averaged mappings and the gradient-projection algorithm
- Hilbertian convex feasibility problem: Convergence of projection methods
- Surrogate gradient algorithm for Lagrangian relaxation
- Convergence of a simple subgradient level method
- Incremental Subgradient Methods for Nondifferentiable Optimization
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Minimization of unsmooth functionals
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Projection algorithms with dynamic stepsize for constrained composite minimization