Projection algorithms with dynamic stepsize for constrained composite minimization
From MaRDI portal
Recommendations
- Projection algorithms for composite minimization
- Incremental gradient projection algorithm for constrained composite minimization problems
- Projection-iteration methods for solving constrained minimization problems
- Accelerated projected gradient method with adaptive step size for compliance minimization problem
- A proximal method for composite minimization
- scientific article; zbMATH DE number 4101955
- A regularized two-step projection method for constrained minimization problems
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
Cites work
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Averaged mappings and the gradient-projection algorithm
- Convergence of a simple subgradient level method
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Distributed asynchronous incremental subgradient methods
- Hilbertian convex feasibility problem: Convergence of projection methods
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- Incremental gradient projection algorithm for constrained composite minimization problems
- Incremental subgradient methods for nondifferentiable optimization
- Minimization of unsmooth functionals
- On Projection Algorithms for Solving Convex Feasibility Problems
- Parallel subgradient methods for convex optimization.
- Projection algorithms for composite minimization
- Surrogate gradient algorithm for Lagrangian relaxation
Cited in
(4)- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Projection algorithms for composite minimization
- Incremental gradient projection algorithm for constrained composite minimization problems
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations
This page was built for publication: Projection algorithms with dynamic stepsize for constrained composite minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225430)