Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
From MaRDI portal
Publication:4591376
Recommendations
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- A regularized gradient projection method for the minimization problem
- A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems
Cited in
(9)- A regularized gradient projection method for the minimization problem
- A regularized two-step projection method for constrained minimization problems
- Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
- Averaged mappings and the gradient-projection algorithm
- A gradient algorithm for finding minimum-norm solution of the split feasibility problem
- An extragradient method for finding minimum-norm solution of the split equilibrium problem
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
This page was built for publication: Regularized gradient-projection methods for finding the minimum-norm solution of equilibrium and the constrained convex minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591376)